Base | Representation |
---|---|
bin | 1001001011111001101010… |
… | …00110001111100001111101 |
3 | 2122112010001020100112212222 |
4 | 10211330311012033201331 |
5 | 10121424322214201023 |
6 | 110543450303335125 |
7 | 4153260566111123 |
oct | 445746506174175 |
9 | 78463036315788 |
10 | 20200122022013 |
11 | 64889072a117a |
12 | 2322b03bb14a5 |
13 | b36b2b98728b |
14 | 4db996623913 |
15 | 2506b8daecc8 |
hex | 125f3518f87d |
20200122022013 has 2 divisors, whose sum is σ = 20200122022014. Its totient is φ = 20200122022012.
The previous prime is 20200122022009. The next prime is 20200122022021. The reversal of 20200122022013 is 31022022100202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18964605296569 + 1235516725444 = 4354837^2 + 1111538^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200122022013 - 22 = 20200122022009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20200122021982 and 20200122022000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200122022063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100061011006 + 10100061011007.
It is an arithmetic number, because the mean of its divisors is an integer number (10100061011007).
Almost surely, 220200122022013 is an apocalyptic number.
It is an amenable number.
20200122022013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200122022013 is an equidigital number, since it uses as much as digits as its factorization.
20200122022013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 20200122022013 its reverse (31022022100202), we get a palindrome (51222144122215).
The spelling of 20200122022013 in words is "twenty trillion, two hundred billion, one hundred twenty-two million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •