Base | Representation |
---|---|
bin | 1001100110011100011000… |
… | …1101011011101000100101 |
3 | 1101101011000222022212212000 |
4 | 2121213012031123220211 |
5 | 2340422302333243401 |
6 | 34241215333515513 |
7 | 2136436003004520 |
oct | 231470615335045 |
9 | 41334028285760 |
10 | 10556060056101 |
11 | 33aa88878439a |
12 | 1225a031a2b99 |
13 | 5b75806ab411 |
14 | 286cb7845bb7 |
15 | 1348c2468186 |
hex | 999c635ba25 |
10556060056101 has 16 divisors (see below), whose sum is σ = 17872694275200. Its totient is φ = 6032034317664.
The previous prime is 10556060056093. The next prime is 10556060056103. The reversal of 10556060056101 is 10165006065501.
10556060056101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10556060056101 - 23 = 10556060056093 is a prime.
It is a super-2 number, since 2×105560600561012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10556060056103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27926084616 + ... + 27926084993.
It is an arithmetic number, because the mean of its divisors is an integer number (1117043392200).
Almost surely, 210556060056101 is an apocalyptic number.
It is an amenable number.
10556060056101 is a deficient number, since it is larger than the sum of its proper divisors (7316634219099).
10556060056101 is an equidigital number, since it uses as much as digits as its factorization.
10556060056101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55852169625 (or 55852169619 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 10556060056101 in words is "ten trillion, five hundred fifty-six billion, sixty million, fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •