Base | Representation |
---|---|
bin | 10011100010100010… |
… | …10111000100100011 |
3 | 1000002002101000022002 |
4 | 21301101113010203 |
5 | 132441004422242 |
6 | 4452535434215 |
7 | 520650112634 |
oct | 116121270443 |
9 | 30062330262 |
10 | 10490310947 |
11 | 44a3563976 |
12 | 204922596b |
13 | cb245c3ac |
14 | 71731588b |
15 | 415e60432 |
hex | 271457123 |
10490310947 has 2 divisors, whose sum is σ = 10490310948. Its totient is φ = 10490310946.
The previous prime is 10490310907. The next prime is 10490310949. The reversal of 10490310947 is 74901309401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10490310947 - 210 = 10490309923 is a prime.
It is a super-2 number, since 2×104903109472 (a number of 21 digits) contains 22 as substring.
Together with 10490310949, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10490310947.
It is not a weakly prime, because it can be changed into another prime (10490310949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5245155473 + 5245155474.
It is an arithmetic number, because the mean of its divisors is an integer number (5245155474).
Almost surely, 210490310947 is an apocalyptic number.
10490310947 is a deficient number, since it is larger than the sum of its proper divisors (1).
10490310947 is an equidigital number, since it uses as much as digits as its factorization.
10490310947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 38.
The spelling of 10490310947 in words is "ten billion, four hundred ninety million, three hundred ten thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •