Base | Representation |
---|---|
bin | 1001001100100000100011… |
… | …00010001101111000101101 |
3 | 2122121002221021100111100021 |
4 | 10212100101202031320231 |
5 | 10122300102023241023 |
6 | 111001222123402141 |
7 | 4154630143565536 |
oct | 446202142157055 |
9 | 78532837314307 |
10 | 20221000212013 |
11 | 6496750506357 |
12 | 2326b70083351 |
13 | b38aa8290363 |
14 | 4dc9b73c968d |
15 | 250edbc9a35d |
hex | 12641188de2d |
20221000212013 has 2 divisors, whose sum is σ = 20221000212014. Its totient is φ = 20221000212012.
The previous prime is 20221000211987. The next prime is 20221000212037. The reversal of 20221000212013 is 31021200012202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18930826815849 + 1290173396164 = 4350957^2 + 1135858^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221000212013 - 25 = 20221000211981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221000242013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110500106006 + 10110500106007.
It is an arithmetic number, because the mean of its divisors is an integer number (10110500106007).
Almost surely, 220221000212013 is an apocalyptic number.
It is an amenable number.
20221000212013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221000212013 is an equidigital number, since it uses as much as digits as its factorization.
20221000212013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20221000212013 its reverse (31021200012202), we get a palindrome (51242200224215).
The spelling of 20221000212013 in words is "twenty trillion, two hundred twenty-one billion, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •