Base | Representation |
---|---|
bin | 101110101010110100… |
… | …1001111001001100001 |
3 | 100120200120201110101212 |
4 | 1131111221033021201 |
5 | 3120223101333441 |
6 | 114012502235505 |
7 | 10145400321332 |
oct | 1352551171141 |
9 | 316616643355 |
10 | 100221121121 |
11 | 3955a234730 |
12 | 1750ba25b95 |
13 | 95b2580544 |
14 | 4bca580289 |
15 | 2918866eeb |
hex | 1755a4f261 |
100221121121 has 32 divisors (see below), whose sum is σ = 116876390400. Its totient is φ = 85081953600.
The previous prime is 100221121103. The next prime is 100221121181. The reversal of 100221121121 is 121121122001.
It is a cyclic number.
It is not a de Polignac number, because 100221121121 - 26 = 100221121057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100221121096 and 100221121105.
It is not an unprimeable number, because it can be changed into a prime (100221121181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1175855 + ... + 1258203.
It is an arithmetic number, because the mean of its divisors is an integer number (3652387200).
Almost surely, 2100221121121 is an apocalyptic number.
100221121121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100221121121 is a deficient number, since it is larger than the sum of its proper divisors (16655269279).
100221121121 is a wasteful number, since it uses less digits than its factorization.
100221121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82517.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100221121121 its reverse (121121122001), we get a palindrome (221342243122).
The spelling of 100221121121 in words is "one hundred billion, two hundred twenty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •