Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …1010111000111011011111 |
3 | 1101101011000100021211122221 |
4 | 2121213011222320323133 |
5 | 2340422243024013210 |
6 | 34241214411450211 |
7 | 2136435533022130 |
oct | 231470552707337 |
9 | 41334010254587 |
10 | 10556051001055 |
11 | 33aa88365a18a |
12 | 1225a00156967 |
13 | 5b757b85a9c1 |
14 | 286cb6569c87 |
15 | 1348c177a1da |
hex | 999c5ab8edf |
10556051001055 has 8 divisors (see below), whose sum is σ = 14476869944352. Its totient is φ = 7238434972128.
The previous prime is 10556051001017. The next prime is 10556051001109. The reversal of 10556051001055 is 55010015065501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10556051001055 - 213 = 10556050992863 is a prime.
It is a super-2 number, since 2×105560510010552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10556051001055.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 150800728552 + ... + 150800728621.
It is an arithmetic number, because the mean of its divisors is an integer number (1809608743044).
Almost surely, 210556051001055 is an apocalyptic number.
10556051001055 is a deficient number, since it is larger than the sum of its proper divisors (3920818943297).
10556051001055 is an equidigital number, since it uses as much as digits as its factorization.
10556051001055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 301601457185.
The product of its (nonzero) digits is 18750, while the sum is 34.
Adding to 10556051001055 its reverse (55010015065501), we get a palindrome (65566066066556).
The spelling of 10556051001055 in words is "ten trillion, five hundred fifty-six billion, fifty-one million, one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •