Base | Representation |
---|---|
bin | 1001010010111101000001… |
… | …0011100111010111100101 |
3 | 1100012010202112110020120112 |
4 | 2110233100103213113211 |
5 | 2314431030313000401 |
6 | 33423321540142405 |
7 | 2103313260332600 |
oct | 224572023472745 |
9 | 40163675406515 |
10 | 10221222000101 |
11 | 3290883396a82 |
12 | 1190b36697a05 |
13 | 591b1b07a3b8 |
14 | 2749d1911337 |
15 | 12ad265673bb |
hex | 94bd04e75e5 |
10221222000101 has 12 divisors (see below), whose sum is σ = 11890045872000. Its totient is φ = 8761008425400.
The previous prime is 10221222000061. The next prime is 10221222000107. The reversal of 10221222000101 is 10100022212201.
It is not a de Polignac number, because 10221222000101 - 234 = 10204042130917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221222000107) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 18377900 + ... + 18925898.
It is an arithmetic number, because the mean of its divisors is an integer number (990837156000).
Almost surely, 210221222000101 is an apocalyptic number.
It is an amenable number.
10221222000101 is a deficient number, since it is larger than the sum of its proper divisors (1668823871899).
10221222000101 is an equidigital number, since it uses as much as digits as its factorization.
10221222000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928664 (or 928657 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10221222000101 its reverse (10100022212201), we get a palindrome (20321244212302).
The spelling of 10221222000101 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty-two million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •