Base | Representation |
---|---|
bin | 111100001101000… |
… | …1001110110011101 |
3 | 12012210012211102211 |
4 | 1320122021312131 |
5 | 13114122401023 |
6 | 532242120421 |
7 | 101026516360 |
oct | 17032116635 |
9 | 5183184384 |
10 | 2020122013 |
11 | 947340628 |
12 | 484650111 |
13 | 2626a1190 |
14 | 1524160d7 |
15 | bc539a0d |
hex | 78689d9d |
2020122013 has 16 divisors (see below), whose sum is σ = 2501210880. Its totient is φ = 1588755456.
The previous prime is 2020122007. The next prime is 2020122017. The reversal of 2020122013 is 3102210202.
It is a cyclic number.
It is not a de Polignac number, because 2020122013 - 29 = 2020121501 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2020121984 and 2020122002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020122017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51268 + ... + 81661.
It is an arithmetic number, because the mean of its divisors is an integer number (156325680).
Almost surely, 22020122013 is an apocalyptic number.
It is an amenable number.
2020122013 is a deficient number, since it is larger than the sum of its proper divisors (481088867).
2020122013 is a wasteful number, since it uses less digits than its factorization.
2020122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133116.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 2020122013 is about 44945.7674648014. The cubic root of 2020122013 is about 1264.1323160787.
Adding to 2020122013 its reverse (3102210202), we get a palindrome (5122332215).
The spelling of 2020122013 in words is "two billion, twenty million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •