Base | Representation |
---|---|
bin | 10011100001010101… |
… | …00101101011001011 |
3 | 1000001101020122012001 |
4 | 21300222211223023 |
5 | 132430404202042 |
6 | 4451533531431 |
7 | 520464531601 |
oct | 116052455313 |
9 | 30041218161 |
10 | 10480147147 |
11 | 4498851738 |
12 | 2045943b77 |
13 | cb0311102 |
14 | 715c2b871 |
15 | 415103bb7 |
hex | 270aa5acb |
10480147147 has 2 divisors, whose sum is σ = 10480147148. Its totient is φ = 10480147146.
The previous prime is 10480147043. The next prime is 10480147159. The reversal of 10480147147 is 74174108401.
10480147147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (74174108401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10480147147 - 211 = 10480145099 is a prime.
It is not a weakly prime, because it can be changed into another prime (10480847147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5240073573 + 5240073574.
It is an arithmetic number, because the mean of its divisors is an integer number (5240073574).
Almost surely, 210480147147 is an apocalyptic number.
10480147147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10480147147 is an equidigital number, since it uses as much as digits as its factorization.
10480147147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25088, while the sum is 37.
The spelling of 10480147147 in words is "ten billion, four hundred eighty million, one hundred forty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •