Base | Representation |
---|---|
bin | 10010101001001010… |
… | …01010000111100011 |
3 | 221211112121221000001 |
4 | 21110211022013203 |
5 | 130444243232012 |
6 | 4333102440431 |
7 | 503013524536 |
oct | 112445120743 |
9 | 27745557001 |
10 | 10008961507 |
11 | 4276885a16 |
12 | 1b33b93117 |
13 | c3680743c |
14 | 6ad416a1d |
15 | 3d8a7d357 |
hex | 25494a1e3 |
10008961507 has 2 divisors, whose sum is σ = 10008961508. Its totient is φ = 10008961506.
The previous prime is 10008961477. The next prime is 10008961513. The reversal of 10008961507 is 70516980001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10008961507 is a prime.
It is a super-2 number, since 2×100089615072 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10008961517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5004480753 + 5004480754.
It is an arithmetic number, because the mean of its divisors is an integer number (5004480754).
Almost surely, 210008961507 is an apocalyptic number.
10008961507 is a deficient number, since it is larger than the sum of its proper divisors (1).
10008961507 is an equidigital number, since it uses as much as digits as its factorization.
10008961507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 37.
It can be divided in two parts, 100089 and 61507, that added together give a triangular number (161596 = T568).
The spelling of 10008961507 in words is "ten billion, eight million, nine hundred sixty-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •