Base | Representation |
---|---|
bin | 10000000101101000001… |
… | …101101001111001001001 |
3 | 10220200122000210021000201 |
4 | 100011220031221321021 |
5 | 121103134040130001 |
6 | 2203515052332201 |
7 | 142605453330256 |
oct | 20055015517111 |
9 | 3820560707021 |
10 | 1105555005001 |
11 | 396954a84517 |
12 | 15a320174061 |
13 | 8033a90a495 |
14 | 3b71b15c42d |
15 | 1db584d8501 |
hex | 10168369e49 |
1105555005001 has 32 divisors (see below), whose sum is σ = 1198059033600. Its totient is φ = 1016364948480.
The previous prime is 1105555004969. The next prime is 1105555005007. The reversal of 1105555005001 is 1005005555011.
It is not a de Polignac number, because 1105555005001 - 25 = 1105555004969 is a prime.
It is a super-2 number, since 2×11055550050012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1105555005007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92439460 + ... + 92451418.
It is an arithmetic number, because the mean of its divisors is an integer number (37439344800).
Almost surely, 21105555005001 is an apocalyptic number.
It is an amenable number.
1105555005001 is a deficient number, since it is larger than the sum of its proper divisors (92504028599).
1105555005001 is a wasteful number, since it uses less digits than its factorization.
1105555005001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12649.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 1105555005001 in words is "one trillion, one hundred five billion, five hundred fifty-five million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •