Base | Representation |
---|---|
bin | 1001010010111100001100… |
… | …0100110101010011100101 |
3 | 1100012010012001202112210112 |
4 | 2110233003010311103211 |
5 | 2314430102001134341 |
6 | 33423243530302405 |
7 | 2103304623465053 |
oct | 224570304652345 |
9 | 40163161675715 |
10 | 10221000021221 |
11 | 329077a061a60 |
12 | 1190a94287a05 |
13 | 591ab4099052 |
14 | 2749b024b1d3 |
15 | 12ad11d1aaeb |
hex | 94bc31354e5 |
10221000021221 has 16 divisors (see below), whose sum is σ = 11182306512960. Its totient is φ = 9265064561280.
The previous prime is 10221000021143. The next prime is 10221000021251. The reversal of 10221000021221 is 12212000012201.
It is not a de Polignac number, because 10221000021221 - 230 = 10219926279397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221000021196 and 10221000021205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221000021251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11705750 + ... + 12548568.
It is an arithmetic number, because the mean of its divisors is an integer number (698894157060).
Almost surely, 210221000021221 is an apocalyptic number.
10221000021221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10221000021221 is a deficient number, since it is larger than the sum of its proper divisors (961306491739).
10221000021221 is a wasteful number, since it uses less digits than its factorization.
10221000021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846004.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10221000021221 its reverse (12212000012201), we get a palindrome (22433000033422).
The spelling of 10221000021221 in words is "ten trillion, two hundred twenty-one billion, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •