Base | Representation |
---|---|
bin | 10110110000111101111001… |
… | …100000100100111100001110 |
3 | 111010111120102210202202112020 |
4 | 112300331321200210330032 |
5 | 101110344344413020420 |
6 | 552535231020551010 |
7 | 30042402010326531 |
oct | 2660757140447416 |
9 | 433446383682466 |
10 | 100122021220110 |
11 | 299a156889193a |
12 | b29039a3b2466 |
13 | 43b3609cc7236 |
14 | 1aa1d08778a18 |
15 | b8960be2a340 |
hex | 5b0f79824f0e |
100122021220110 has 32 divisors (see below), whose sum is σ = 240293177989920. Its totient is φ = 26699169318528.
The previous prime is 100122021220087. The next prime is 100122021220181. The reversal of 100122021220110 is 11022120221001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 100122021220110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25841596 + ... + 29462384.
It is an arithmetic number, because the mean of its divisors is an integer number (7509161812185).
Almost surely, 2100122021220110 is an apocalyptic number.
100122021220110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100122021220110 is an abundant number, since it is smaller than the sum of its proper divisors (140171156769810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100122021220110 is a wasteful number, since it uses less digits than its factorization.
100122021220110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4542532.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100122021220110 its reverse (11022120221001), we get a palindrome (111144141441111).
The spelling of 100122021220110 in words is "one hundred trillion, one hundred twenty-two billion, twenty-one million, two hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •