Base | Representation |
---|---|
bin | 10110110010010001110010… |
… | …101011101011001111011000 |
3 | 111010211011221121202211002210 |
4 | 112302101302223223033120 |
5 | 101113333340324032300 |
6 | 553044445331155120 |
7 | 30052041166001115 |
oct | 2662216253531730 |
9 | 433734847684083 |
10 | 100212101002200 |
11 | 29a26793545440 |
12 | b2a5939a45aa0 |
13 | 43bbc64501645 |
14 | 1aa64120c390c |
15 | b8bb302b6050 |
hex | 5b2472aeb3d8 |
100212101002200 has 96 divisors (see below), whose sum is σ = 338899105229760. Its totient is φ = 24293842665600.
The previous prime is 100212101002151. The next prime is 100212101002213. The reversal of 100212101002200 is 2200101212001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7591819234 + ... + 7591832433.
It is an arithmetic number, because the mean of its divisors is an integer number (3530199012810).
Almost surely, 2100212101002200 is an apocalyptic number.
100212101002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100212101002200 is an abundant number, since it is smaller than the sum of its proper divisors (238687004227560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100212101002200 is a wasteful number, since it uses less digits than its factorization.
100212101002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15183651697 (or 15183651688 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100212101002200 its reverse (2200101212001), we get a palindrome (102412202214201).
The spelling of 100212101002200 in words is "one hundred trillion, two hundred twelve billion, one hundred one million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •