Base | Representation |
---|---|
bin | 101110101010100001… |
… | …1011110001010000001 |
3 | 100120122220002111011012 |
4 | 1131111003132022001 |
5 | 3120213033033441 |
6 | 114011510130305 |
7 | 10145220216344 |
oct | 1352503361201 |
9 | 316586074135 |
10 | 100211221121 |
11 | 39554692710 |
12 | 17508650995 |
13 | 95b04c535b |
14 | 4bc912445b |
15 | 2917a5d9eb |
hex | 17550de281 |
100211221121 has 64 divisors (see below), whose sum is σ = 122863910400. Its totient is φ = 80650752000.
The previous prime is 100211221111. The next prime is 100211221129. The reversal of 100211221121 is 121122112001.
It is a cyclic number.
It is not a de Polignac number, because 100211221121 - 26 = 100211221057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100211221096 and 100211221105.
It is not an unprimeable number, because it can be changed into a prime (100211221129) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 43399115 + ... + 43401423.
It is an arithmetic number, because the mean of its divisors is an integer number (1919748600).
Almost surely, 2100211221121 is an apocalyptic number.
100211221121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100211221121 is a deficient number, since it is larger than the sum of its proper divisors (22652689279).
100211221121 is a wasteful number, since it uses less digits than its factorization.
100211221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2570.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100211221121 its reverse (121122112001), we get a palindrome (221333333122).
The spelling of 100211221121 in words is "one hundred billion, two hundred eleven million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •