Base | Representation |
---|---|
bin | 1001010010111101011000… |
… | …1110000100100011111101 |
3 | 1100012011000110010122010021 |
4 | 2110233112032010203331 |
5 | 2314431231212210414 |
6 | 33423335442412141 |
7 | 2103315603524602 |
oct | 224572616044375 |
9 | 40164013118107 |
10 | 10221321210109 |
11 | 3290924398a19 |
12 | 1190b63961051 |
13 | 591b357a5449 |
14 | 274a00b786a9 |
15 | 12ad30112c24 |
hex | 94bd63848fd |
10221321210109 has 2 divisors, whose sum is σ = 10221321210110. Its totient is φ = 10221321210108.
The previous prime is 10221321210097. The next prime is 10221321210131. The reversal of 10221321210109 is 90101212312201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9632003981209 + 589317228900 = 3103547^2 + 767670^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221321210109 - 211 = 10221321208061 is a prime.
It is a super-2 number, since 2×102213212101092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221321220109) 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 as a sum of consecutive naturals, namely, 5110660605054 + 5110660605055.
It is an arithmetic number, because the mean of its divisors is an integer number (5110660605055).
Almost surely, 210221321210109 is an apocalyptic number.
It is an amenable number.
10221321210109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221321210109 is an equidigital number, since it uses as much as digits as its factorization.
10221321210109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 10221321210109 in words is "ten trillion, two hundred twenty-one billion, three hundred twenty-one million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •