Base | Representation |
---|---|
bin | 10100010110111100… |
… | …10001010101100011 |
3 | 1001012201112121011021 |
4 | 22023132101111203 |
5 | 134341023343242 |
6 | 5004321430311 |
7 | 534565433155 |
oct | 121336212543 |
9 | 31181477137 |
10 | 10929902947 |
11 | 46a9710947 |
12 | 215049b397 |
13 | 10525538c2 |
14 | 759864ad5 |
15 | 43e844b67 |
hex | 28b791563 |
10929902947 has 2 divisors, whose sum is σ = 10929902948. Its totient is φ = 10929902946.
The previous prime is 10929902861. The next prime is 10929902981. The reversal of 10929902947 is 74920992901.
10929902947 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 a cyclic number.
It is not a de Polignac number, because 10929902947 - 215 = 10929870179 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10929902894 and 10929902903.
It is not a weakly prime, because it can be changed into another prime (10929902047) 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, 5464951473 + 5464951474.
It is an arithmetic number, because the mean of its divisors is an integer number (5464951474).
Almost surely, 210929902947 is an apocalyptic number.
10929902947 is a deficient number, since it is larger than the sum of its proper divisors (1).
10929902947 is an equidigital number, since it uses as much as digits as its factorization.
10929902947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 734832, while the sum is 52.
The spelling of 10929902947 in words is "ten billion, nine hundred twenty-nine million, nine hundred two thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •