Base | Representation |
---|---|
bin | 1001101111000011101100… |
… | …1010100000111000100011 |
3 | 1101220022000201121112120022 |
4 | 2123300323022200320203 |
5 | 2400333344041113012 |
6 | 34433212335504055 |
7 | 2153225236150343 |
oct | 233607312407043 |
9 | 41808021545508 |
10 | 10704051113507 |
11 | 3457620888204 |
12 | 124a62508802b |
13 | 5c85069a203b |
14 | 290116490d23 |
15 | 1386849ba472 |
hex | 9bc3b2a0e23 |
10704051113507 has 2 divisors, whose sum is σ = 10704051113508. Its totient is φ = 10704051113506.
The previous prime is 10704051113473. The next prime is 10704051113593. The reversal of 10704051113507 is 70531115040701.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10704051113507 - 226 = 10703984004643 is a prime.
It is a super-2 number, since 2×107040511135072 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10704051113597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5352025556753 + 5352025556754.
It is an arithmetic number, because the mean of its divisors is an integer number (5352025556754).
Almost surely, 210704051113507 is an apocalyptic number.
10704051113507 is a deficient number, since it is larger than the sum of its proper divisors (1).
10704051113507 is an equidigital number, since it uses as much as digits as its factorization.
10704051113507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14700, while the sum is 35.
The spelling of 10704051113507 in words is "ten trillion, seven hundred four billion, fifty-one million, one hundred thirteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •