Base | Representation |
---|---|
bin | 1001100110011100001100… |
… | …1110111001111001010111 |
3 | 1101101010220111100101102211 |
4 | 2121213003032321321113 |
5 | 2340422202042014201 |
6 | 34241210351214251 |
7 | 2136434525324623 |
oct | 231470316717127 |
9 | 41333814311384 |
10 | 10556010110551 |
11 | 33aa862570584 |
12 | 12259aa517387 |
13 | 5b7573241a39 |
14 | 286cb0d64183 |
15 | 1348bcd9e651 |
hex | 999c33b9e57 |
10556010110551 has 2 divisors, whose sum is σ = 10556010110552. Its totient is φ = 10556010110550.
The previous prime is 10556010110543. The next prime is 10556010110687. The reversal of 10556010110551 is 15501101065501.
It is a weak prime.
It is an emirp because it is prime and its reverse (15501101065501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10556010110551 - 23 = 10556010110543 is a prime.
It is a super-2 number, since 2×105560101105512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10586010110551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5278005055275 + 5278005055276.
It is an arithmetic number, because the mean of its divisors is an integer number (5278005055276).
Almost surely, 210556010110551 is an apocalyptic number.
10556010110551 is a deficient number, since it is larger than the sum of its proper divisors (1).
10556010110551 is an equidigital number, since it uses as much as digits as its factorization.
10556010110551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 10556010110551 in words is "ten trillion, five hundred fifty-six billion, ten million, one hundred ten thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •