Base | Representation |
---|---|
bin | 1001101001010100111101… |
… | …0110011111100111011011 |
3 | 1101112212220212220210002010 |
4 | 2122111033112133213123 |
5 | 2342230240010104210 |
6 | 34320051541441003 |
7 | 2143141535524311 |
oct | 232251726374733 |
9 | 41485825823063 |
10 | 10605605550555 |
11 | 34198a2933724 |
12 | 123352ba10163 |
13 | 5bc148234742 |
14 | 289457a640b1 |
15 | 135d21e7e920 |
hex | 9a54f59f9db |
10605605550555 has 16 divisors (see below), whose sum is σ = 17045062917120. Its totient is φ = 5630958281568.
The previous prime is 10605605550539. The next prime is 10605605550557. The reversal of 10605605550555 is 55505550650601.
It is not a de Polignac number, because 10605605550555 - 24 = 10605605550539 is a prime.
It is a super-3 number, since 3×106056055505553 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10605605550557) 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, 1585288965 + ... + 1585295654.
It is an arithmetic number, because the mean of its divisors is an integer number (1065316432320).
Almost surely, 210605605550555 is an apocalyptic number.
10605605550555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10605605550555 is a deficient number, since it is larger than the sum of its proper divisors (6439457366565).
10605605550555 is a wasteful number, since it uses less digits than its factorization.
10605605550555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3170584850.
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 10605605550555 in words is "ten trillion, six hundred five billion, six hundred five million, five hundred fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •