Base | Representation |
---|---|
bin | 10110110000101110000110… |
… | …001111111111001001001010 |
3 | 111010102221122102000211210010 |
4 | 112300232012033333021022 |
5 | 101110110123101334420 |
6 | 552523343310132350 |
7 | 30041231404616052 |
oct | 2660560617771112 |
9 | 433387572024703 |
10 | 100105055105610 |
11 | 29995351967a05 |
12 | b2890444b10b6 |
13 | 43b1b35039529 |
14 | 1aa117939a562 |
15 | b88e676e84e0 |
hex | 5b0b863ff24a |
100105055105610 has 64 divisors (see below), whose sum is σ = 240580951511040. Its totient is φ = 26658157135680.
The previous prime is 100105055105603. The next prime is 100105055105617. The reversal of 100105055105610 is 16501550501001.
It is an interprime number because it is at equal distance from previous prime (100105055105603) and next prime (100105055105617).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (100105055105617) 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, 143397669 + ... + 144094071.
It is an arithmetic number, because the mean of its divisors is an integer number (3759077367360).
Almost surely, 2100105055105610 is an apocalyptic number.
100105055105610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100105055105610 is an abundant number, since it is smaller than the sum of its proper divisors (140475896405430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100105055105610 is a wasteful number, since it uses less digits than its factorization.
100105055105610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702963.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 100105055105610 in words is "one hundred trillion, one hundred five billion, fifty-five million, one hundred five thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.896 sec. • engine limits •