Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1100111111000000010000 |
3 | 1100012010110210222112010110 |
4 | 2110233021230333000100 |
5 | 2314430313432210000 |
6 | 33423302541401320 |
7 | 2103310443540435 |
oct | 224571154770020 |
9 | 40163423875113 |
10 | 10221111210000 |
11 | 32908268a5809 |
12 | 1190b05569240 |
13 | 591b01129522 |
14 | 2749c0d11b8c |
15 | 12ad1b980850 |
hex | 94bc9b3f010 |
10221111210000 has 100 divisors (see below), whose sum is σ = 32995109897552. Its totient is φ = 2725629648000.
The previous prime is 10221111209999. The next prime is 10221111210067. The reversal of 10221111210000 is 1211112201.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×102211112100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 170321854 + ... + 170381853.
Almost surely, 210221111210000 is an apocalyptic number.
10221111210000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10221111210000 is an abundant number, since it is smaller than the sum of its proper divisors (22773998687552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221111210000 is an equidigital number, since it uses as much as digits as its factorization.
10221111210000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340703738 (or 340703717 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10221111210000 its reverse (1211112201), we get a palindrome (10222322322201).
The spelling of 10221111210000 in words is "ten trillion, two hundred twenty-one billion, one hundred eleven million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •