Base | Representation |
---|---|
bin | 101110110100111100… |
… | …1111100011111001111 |
3 | 100121120021100101221000 |
4 | 1131221321330133033 |
5 | 3121422111423310 |
6 | 114110324111343 |
7 | 10156665532353 |
oct | 1355171743717 |
9 | 317507311830 |
10 | 100561045455 |
11 | 397140a7932 |
12 | 175a5835553 |
13 | 9637b195c0 |
14 | 4c1d787463 |
15 | 29386104c0 |
hex | 1769e7c7cf |
100561045455 has 192 divisors, whose sum is σ = 205478784000. Its totient is φ = 46376478720.
The previous prime is 100561045451. The next prime is 100561045477. The reversal of 100561045455 is 554540165001.
100561045455 is a `hidden beast` number, since 1 + 0 + 0 + 5 + 6 + 104 + 545 + 5 = 666.
It is not a de Polignac number, because 100561045455 - 22 = 100561045451 is a prime.
It is a super-2 number, since 2×1005610454552 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100561045451) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 167881246 + ... + 167881844.
It is an arithmetic number, because the mean of its divisors is an integer number (1070202000).
Almost surely, 2100561045455 is an apocalyptic number.
100561045455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
100561045455 is an abundant number, since it is smaller than the sum of its proper divisors (104917738545).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100561045455 is a wasteful number, since it uses less digits than its factorization.
100561045455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991 (or 968 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 100561045455 in words is "one hundred billion, five hundred sixty-one million, forty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.340 sec. • engine limits •