Base | Representation |
---|---|
bin | 1001001100100100101001… |
… | …10001010111110010001101 |
3 | 2122121022121201101220122222 |
4 | 10212102110301113302031 |
5 | 10122314104203000023 |
6 | 111002224415345125 |
7 | 4155035540512535 |
oct | 446222461276215 |
9 | 78538551356588 |
10 | 20223202000013 |
11 | 6497680347261 |
12 | 23274855221a5 |
13 | b390694997ac |
14 | 4dcb459b04c5 |
15 | 2510ba21bcc8 |
hex | 126494c57c8d |
20223202000013 has 2 divisors, whose sum is σ = 20223202000014. Its totient is φ = 20223202000012.
The previous prime is 20223201999997. The next prime is 20223202000019. The reversal of 20223202000013 is 31000020232202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15700510737769 + 4522691262244 = 3962387^2 + 2126662^2 .
It is a cyclic number.
It is not a de Polignac number, because 20223202000013 - 24 = 20223201999997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20223201999955 and 20223202000000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20223202000019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10111601000006 + 10111601000007.
It is an arithmetic number, because the mean of its divisors is an integer number (10111601000007).
Almost surely, 220223202000013 is an apocalyptic number.
It is an amenable number.
20223202000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20223202000013 is an equidigital number, since it uses as much as digits as its factorization.
20223202000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 20223202000013 its reverse (31000020232202), we get a palindrome (51223222232215).
The spelling of 20223202000013 in words is "twenty trillion, two hundred twenty-three billion, two hundred two million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •