Base | Representation |
---|---|
bin | 1001010010011010101011… |
… | …0000111010000100110100 |
3 | 1100011020221222210101100210 |
4 | 2110212222300322010310 |
5 | 2314303140031210400 |
6 | 33415155024105420 |
7 | 2102535635401425 |
oct | 224465260720464 |
9 | 40136858711323 |
10 | 10212002210100 |
11 | 3287982026319 |
12 | 118b1a2a65270 |
13 | 590cabc04162 |
14 | 27439924564c |
15 | 12a986e22950 |
hex | 949aac3a134 |
10212002210100 has 72 divisors (see below), whose sum is σ = 29851331906368. Its totient is φ = 2695126348800.
The previous prime is 10212002210077. The next prime is 10212002210101. The reversal of 10212002210100 is 101220021201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212002210101) 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 23 ways as a sum of consecutive naturals, for example, 175434856 + ... + 175493055.
Almost surely, 210212002210100 is an apocalyptic number.
10212002210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10212002210100 is an abundant number, since it is smaller than the sum of its proper divisors (19639329696268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212002210100 is a wasteful number, since it uses less digits than its factorization.
10212002210100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350928025 (or 350928018 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10212002210100 its reverse (101220021201), we get a palindrome (10313222231301).
The spelling of 10212002210100 in words is "ten trillion, two hundred twelve billion, two million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •