Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0111010111011101101101 |
3 | 1100012010201010211202001222 |
4 | 2110233033013113131231 |
5 | 2314431010203341023 |
6 | 33423315543513125 |
7 | 2103312625413356 |
oct | 224571707273555 |
9 | 40163633752058 |
10 | 10221202012013 |
11 | 32908730846a3 |
12 | 1190b2ba587a5 |
13 | 591b16b9c525 |
14 | 2749ccdcad2d |
15 | 12ad24919cc8 |
hex | 94bcf1d776d |
10221202012013 has 2 divisors, whose sum is σ = 10221202012014. Its totient is φ = 10221202012012.
The previous prime is 10221202012001. The next prime is 10221202012061. The reversal of 10221202012013 is 31021020212201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10150678836169 + 70523175844 = 3186013^2 + 265562^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221202012013 - 212 = 10221202007917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221202011982 and 10221202012000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221202012093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110601006006 + 5110601006007.
It is an arithmetic number, because the mean of its divisors is an integer number (5110601006007).
Almost surely, 210221202012013 is an apocalyptic number.
It is an amenable number.
10221202012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221202012013 is an equidigital number, since it uses as much as digits as its factorization.
10221202012013 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 17.
Adding to 10221202012013 its reverse (31021020212201), we get a palindrome (41242222224214).
The spelling of 10221202012013 in words is "ten trillion, two hundred twenty-one billion, two hundred two million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •