Base | Representation |
---|---|
bin | 10110110010010001111000… |
… | …101101110010101001010111 |
3 | 111010211012012200020012222121 |
4 | 112302101320231302221113 |
5 | 101113334042232020434 |
6 | 553044503344440411 |
7 | 30052043535225103 |
oct | 2662217055625127 |
9 | 433735180205877 |
10 | 100212202220119 |
11 | 29a26835698a10 |
12 | b2a5967919107 |
13 | 43bbc7c4805c2 |
14 | 1aa6421710903 |
15 | b8bb3910b7b4 |
hex | 5b2478b72a57 |
100212202220119 has 32 divisors (see below), whose sum is σ = 111196826749440. Its totient is φ = 89547909091200.
The previous prime is 100212202220083. The next prime is 100212202220197. The reversal of 100212202220119 is 911022202212001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100212202220119 - 29 = 100212202219607 is a prime.
It is a super-2 number, since 2×1002122022201192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100212202220093 and 100212202220102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100212202220219) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 797062449 + ... + 797188165.
It is an arithmetic number, because the mean of its divisors is an integer number (3474900835920).
Almost surely, 2100212202220119 is an apocalyptic number.
100212202220119 is a deficient number, since it is larger than the sum of its proper divisors (10984624529321).
100212202220119 is a wasteful number, since it uses less digits than its factorization.
100212202220119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128871.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 100212202220119 in words is "one hundred trillion, two hundred twelve billion, two hundred two million, two hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •