Base | Representation |
---|---|
bin | 10110101111100000101111… |
… | …110110100001101001100001 |
3 | 111010011000021020110220022110 |
4 | 112233200233312201221201 |
5 | 101102230024302241001 |
6 | 552421250101025533 |
7 | 30032231301306411 |
oct | 2657405766415141 |
9 | 433130236426273 |
10 | 100022001212001 |
11 | 29963102130410 |
12 | b274b259b52a9 |
13 | 43a705a30079b |
14 | 1a9b13abca641 |
15 | b86c0608c3d6 |
hex | 5af82fda1a61 |
100022001212001 has 16 divisors (see below), whose sum is σ = 146121859661760. Its totient is φ = 60354681155520.
The previous prime is 100022001211987. The next prime is 100022001212017. The reversal of 100022001212001 is 100212100220001.
It is not a de Polignac number, because 100022001212001 - 235 = 99987641473633 is a prime.
It is a super-3 number, since 3×1000220012120013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (100022001211001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6617830290 + ... + 6617845403.
It is an arithmetic number, because the mean of its divisors is an integer number (9132616228860).
Almost surely, 2100022001212001 is an apocalyptic number.
100022001212001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100022001212001 is a deficient number, since it is larger than the sum of its proper divisors (46099858449759).
100022001212001 is a wasteful number, since it uses less digits than its factorization.
100022001212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13235675936.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100022001212001 its reverse (100212100220001), we get a palindrome (200234101432002).
The spelling of 100022001212001 in words is "one hundred trillion, twenty-two billion, one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •