Base | Representation |
---|---|
bin | 11000000000000010101111… |
… | …011111110000110001110100 |
3 | 111211202001122100120012102201 |
4 | 120000002233133300301310 |
5 | 102313412303003334211 |
6 | 1012255441303514244 |
7 | 31143113404103551 |
oct | 3000025737606164 |
9 | 454661570505381 |
10 | 105556060605556 |
11 | 306a708a409900 |
12 | ba0957b158984 |
13 | 46b8b808c3212 |
14 | 1c0cd24db5a28 |
15 | c30b4e5c40c1 |
hex | 6000af7f0c74 |
105556060605556 has 72 divisors (see below), whose sum is σ = 214423359619392. Its totient is φ = 45340999968000.
The previous prime is 105556060605469. The next prime is 105556060605559. The reversal of 105556060605556 is 655506060655501.
It is a super-2 number, since 2×1055560606055562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105556060605497 and 105556060605506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105556060605559) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 56197845 + ... + 58045756.
It is an arithmetic number, because the mean of its divisors is an integer number (2978102216936).
Almost surely, 2105556060605556 is an apocalyptic number.
It is an amenable number.
105556060605556 is an abundant number, since it is smaller than the sum of its proper divisors (108867299013836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105556060605556 is a wasteful number, since it uses less digits than its factorization.
105556060605556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114243733 (or 114243720 counting only the distinct ones).
The product of its (nonzero) digits is 20250000, while the sum is 55.
The spelling of 105556060605556 in words is "one hundred five trillion, five hundred fifty-six billion, sixty million, six hundred five thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •