Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …001011001011110100011110 |
3 | 111010210222120001011002212002 |
4 | 112302033312023023310132 |
5 | 101113320101100010420 |
6 | 553043502151042302 |
7 | 30051635342466530 |
oct | 2662176613136436 |
9 | 433728501132762 |
10 | 100210012110110 |
11 | 29a25911403941 |
12 | b2a5456370392 |
13 | 43bb9c0802716 |
14 | 1aa62948c9850 |
15 | b8ba5bbe5075 |
hex | 5b23f62cbd1e |
100210012110110 has 128 divisors (see below), whose sum is σ = 224042974617600. Its totient is φ = 31492829237760.
The previous prime is 100210012110083. The next prime is 100210012110119. The reversal of 100210012110110 is 11011210012001.
It is a junction number, because it is equal to n+sod(n) for n = 100210012110091 and 100210012110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100210012110119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 198187496 + ... + 198692484.
It is an arithmetic number, because the mean of its divisors is an integer number (1750335739200).
Almost surely, 2100210012110110 is an apocalyptic number.
100210012110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100210012110110 is an abundant number, since it is smaller than the sum of its proper divisors (123832962507490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100210012110110 is a wasteful number, since it uses less digits than its factorization.
100210012110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509866.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100210012110110 its reverse (11011210012001), we get a palindrome (111221222122111).
The spelling of 100210012110110 in words is "one hundred trillion, two hundred ten billion, twelve million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •