Base | Representation |
---|---|
bin | 1001010010011011000010… |
… | …0110000001111101010101 |
3 | 1100011021012210211202012111 |
4 | 2110212300212001331111 |
5 | 2314303340101201401 |
6 | 33415212440351021 |
7 | 2102541233651545 |
oct | 224466046017525 |
9 | 40137183752174 |
10 | 10212100022101 |
11 | 3287a2226298a |
12 | 118b20b775471 |
13 | 590cc625ca93 |
14 | 2743a8227325 |
15 | 12a9907e3e51 |
hex | 949b0981f55 |
10212100022101 has 8 divisors (see below), whose sum is σ = 10656223462080. Its totient is φ = 9767986506432.
The previous prime is 10212100022039. The next prime is 10212100022141. The reversal of 10212100022101 is 10122000121201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10212100022101 - 213 = 10212100013909 is a prime.
It is a super-2 number, since 2×102121000221012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212100022141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 338971 + ... + 4532008.
It is an arithmetic number, because the mean of its divisors is an integer number (1332027932760).
Almost surely, 210212100022101 is an apocalyptic number.
It is an amenable number.
10212100022101 is a deficient number, since it is larger than the sum of its proper divisors (444123439979).
10212100022101 is an equidigital number, since it uses as much as digits as its factorization.
10212100022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4962155.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10212100022101 its reverse (10122000121201), we get a palindrome (20334100143302).
The spelling of 10212100022101 in words is "ten trillion, two hundred twelve billion, one hundred million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •