Base | Representation |
---|---|
bin | 1001001011111001011101… |
… | …00011010101111110001101 |
3 | 2122112002202120201112012122 |
4 | 10211330232203111332031 |
5 | 10121424111111210221 |
6 | 110543431341542325 |
7 | 4153255063531505 |
oct | 445745643257615 |
9 | 78462676645178 |
10 | 20200012210061 |
11 | 64888603088a2 |
12 | 2322a932749a5 |
13 | b36b11cb96a8 |
14 | 4db985bdaa05 |
15 | 2506ae41ceab |
hex | 125f2e8d5f8d |
20200012210061 has 2 divisors, whose sum is σ = 20200012210062. Its totient is φ = 20200012210060.
The previous prime is 20200012210019. The next prime is 20200012210073. The reversal of 20200012210061 is 16001221000202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12047188460836 + 8152823749225 = 3470906^2 + 2855315^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200012210061 - 210 = 20200012209037 is a prime.
It is a super-2 number, since 2×202000122100612 (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 (20200012216061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100006105030 + 10100006105031.
It is an arithmetic number, because the mean of its divisors is an integer number (10100006105031).
Almost surely, 220200012210061 is an apocalyptic number.
It is an amenable number.
20200012210061 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200012210061 is an equidigital number, since it uses as much as digits as its factorization.
20200012210061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20200012210061 its reverse (16001221000202), we get a palindrome (36201233210263).
The spelling of 20200012210061 in words is "twenty trillion, two hundred billion, twelve million, two hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •