Base | Representation |
---|---|
bin | 10110110010011010001011… |
… | …101010010001111000110001 |
3 | 111010212001012110210101102110 |
4 | 112302122023222101320301 |
5 | 101114010313130014301 |
6 | 553052535313235533 |
7 | 30052510351142250 |
oct | 2662321352217061 |
9 | 433761173711373 |
10 | 100221110001201 |
11 | 29a2a596922762 |
12 | b2a7632b62ba9 |
13 | 43bca6bab2997 |
14 | 1aa6a2879c797 |
15 | b8beab16e0d6 |
hex | 5b268ba91e31 |
100221110001201 has 32 divisors (see below), whose sum is σ = 158157434880000. Its totient is φ = 55233708828480.
The previous prime is 100221110001167. The next prime is 100221110001277. The reversal of 100221110001201 is 102100011122001.
It is not a de Polignac number, because 100221110001201 - 27 = 100221110001073 is a prime.
It is a super-2 number, since 2×1002211100012012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100221110009201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 89767201 + ... + 90876798.
It is an arithmetic number, because the mean of its divisors is an integer number (4942419840000).
Almost surely, 2100221110001201 is an apocalyptic number.
It is an amenable number.
100221110001201 is a deficient number, since it is larger than the sum of its proper divisors (57936324878799).
100221110001201 is a wasteful number, since it uses less digits than its factorization.
100221110001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180644949.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100221110001201 its reverse (102100011122001), we get a palindrome (202321121123202).
The spelling of 100221110001201 in words is "one hundred trillion, two hundred twenty-one billion, one hundred ten million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •