Base | Representation |
---|---|
bin | 10110101111010110001000… |
… | …100111010110101000101110 |
3 | 111010002220212001110000012210 |
4 | 112233112020213112220232 |
5 | 101102033210002130240 |
6 | 552412123215311250 |
7 | 30031346015352141 |
oct | 2657261047265056 |
9 | 433086761400183 |
10 | 100010605505070 |
11 | 2995929459a0a7 |
12 | b27288551b526 |
13 | 43a5c62408930 |
14 | 1a9a779552058 |
15 | b8678a8d6780 |
hex | 5af5889d6a2e |
100010605505070 has 64 divisors (see below), whose sum is σ = 262029894202944. Its totient is φ = 24280762383360.
The previous prime is 100010605505023. The next prime is 100010605505071. The reversal of 100010605505070 is 70505506010001.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010605505071) 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, 1756392421 + ... + 1756449360.
It is an arithmetic number, because the mean of its divisors is an integer number (4094217096921).
Almost surely, 2100010605505070 is an apocalyptic number.
100010605505070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100010605505070 is an abundant number, since it is smaller than the sum of its proper divisors (162019288697874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100010605505070 is a wasteful number, since it uses less digits than its factorization.
100010605505070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3512841877.
The product of its (nonzero) digits is 5250, while the sum is 30.
The spelling of 100010605505070 in words is "one hundred trillion, ten billion, six hundred five million, five hundred five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •