Base | Representation |
---|---|
bin | 1001010001110110001111… |
… | …0101001011011110010001 |
3 | 1100010022201102000001111022 |
4 | 2110131203311023132101 |
5 | 2314123122341304014 |
6 | 33410500340525225 |
7 | 2102041401654401 |
oct | 224354365133621 |
9 | 40108642001438 |
10 | 10202222213009 |
11 | 32838135167a2 |
12 | 11893136b0815 |
13 | 5900b0985828 |
14 | 273b0c3d0801 |
15 | 12a5b3520a8e |
hex | 94763d4b791 |
10202222213009 has 2 divisors, whose sum is σ = 10202222213010. Its totient is φ = 10202222213008.
The previous prime is 10202222212967. The next prime is 10202222213063. The reversal of 10202222213009 is 90031222220201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9122967180625 + 1079255032384 = 3020425^2 + 1038872^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10202222213009 is a prime.
It is a super-2 number, since 2×102022222130092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10202222213809) 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, 5101111106504 + 5101111106505.
It is an arithmetic number, because the mean of its divisors is an integer number (5101111106505).
Almost surely, 210202222213009 is an apocalyptic number.
It is an amenable number.
10202222213009 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202222213009 is an equidigital number, since it uses as much as digits as its factorization.
10202222213009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 10202222213009 in words is "ten trillion, two hundred two billion, two hundred twenty-two million, two hundred thirteen thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •