Base | Representation |
---|---|
bin | 101110101010100001… |
… | …1000011000011101010 |
3 | 100120122212212211220010 |
4 | 1131111003003003222 |
5 | 3120213021010442 |
6 | 114011503512350 |
7 | 10145216244624 |
oct | 1352503030352 |
9 | 316585784803 |
10 | 100211110122 |
11 | 39554617282 |
12 | 175085b86b6 |
13 | 95b0486986 |
14 | 4bc90d5c14 |
15 | 2917a3ab9c |
hex | 17550c30ea |
100211110122 has 8 divisors (see below), whose sum is σ = 200422220256. Its totient is φ = 33403703372.
The previous prime is 100211110067. The next prime is 100211110141. The reversal of 100211110122 is 221011112001.
It is a sphenic number, since it is the product of 3 distinct primes.
100211110122 is an admirable number.
It is a super-2 number, since 2×1002111101222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100211110098 and 100211110107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8350925838 + ... + 8350925849.
It is an arithmetic number, because the mean of its divisors is an integer number (25052777532).
Almost surely, 2100211110122 is an apocalyptic number.
100211110122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100211110122 is a wasteful number, since it uses less digits than its factorization.
100211110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16701851692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100211110122 its reverse (221011112001), we get a palindrome (321222222123).
The spelling of 100211110122 in words is "one hundred billion, two hundred eleven million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •