Base | Representation |
---|---|
bin | 1001100110011000110100… |
… | …0001001111101010001011 |
3 | 1101101001120002212102122210 |
4 | 2121212031001033222023 |
5 | 2340413321220410021 |
6 | 34240540220320203 |
7 | 2136403142301030 |
oct | 231461501175213 |
9 | 41331502772583 |
10 | 10555100560011 |
11 | 33aa436105817 |
12 | 12257959a3063 |
13 | 5b7459983257 |
14 | 286c2623d387 |
15 | 1348680d7e76 |
hex | 9998d04fa8b |
10555100560011 has 32 divisors (see below), whose sum is σ = 16148444205568. Its totient is φ = 6007350666240.
The previous prime is 10555100560007. The next prime is 10555100560013. The reversal of 10555100560011 is 11006500155501.
It is not a de Polignac number, because 10555100560011 - 22 = 10555100560007 is a prime.
It is a super-2 number, since 2×105551005600112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10555100560013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4670196 + ... + 6551406.
It is an arithmetic number, because the mean of its divisors is an integer number (504638881424).
Almost surely, 210555100560011 is an apocalyptic number.
10555100560011 is a deficient number, since it is larger than the sum of its proper divisors (5593343645557).
10555100560011 is a wasteful number, since it uses less digits than its factorization.
10555100560011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1882291.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 10555100560011 in words is "ten trillion, five hundred fifty-five billion, one hundred million, five hundred sixty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •