Base | Representation |
---|---|
bin | 1001010010111100001100… |
… | …1101001011111100011100 |
3 | 1100012010012012212210202011 |
4 | 2110233003031023330130 |
5 | 2314430103031223400 |
6 | 33423244045241004 |
7 | 2103304651215412 |
oct | 224570315137434 |
9 | 40163165783664 |
10 | 10221002211100 |
11 | 329078031827a |
12 | 1190a94b63164 |
13 | 591ab4684a35 |
14 | 2749b065b2b2 |
15 | 12ad120ee8ba |
hex | 94bc334bf1c |
10221002211100 has 72 divisors (see below), whose sum is σ = 22245122123840. Its totient is φ = 4076324455680.
The previous prime is 10221002211089. The next prime is 10221002211131. The reversal of 10221002211100 is 111220012201.
It is a super-3 number, since 3×102210022111003 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 143681341 + ... + 143752459.
Almost surely, 210221002211100 is an apocalyptic number.
10221002211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221002211100 is an abundant number, since it is smaller than the sum of its proper divisors (12024119912740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221002211100 is a wasteful number, since it uses less digits than its factorization.
10221002211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75359 (or 75352 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10221002211100 its reverse (111220012201), we get a palindrome (10332222223301).
The spelling of 10221002211100 in words is "ten trillion, two hundred twenty-one billion, two million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •