Base | Representation |
---|---|
bin | 111100001101000… |
… | …1001101011100001 |
3 | 12012210012210110220 |
4 | 1320122021223201 |
5 | 13114122340223 |
6 | 532242113253 |
7 | 101026514340 |
oct | 17032115341 |
9 | 5183183426 |
10 | 2020121313 |
11 | 947340051 |
12 | 48464b829 |
13 | 2626a0a72 |
14 | 152415b57 |
15 | bc5396e3 |
hex | 78689ae1 |
2020121313 has 16 divisors (see below), whose sum is σ = 3115370496. Its totient is φ = 1140446160.
The previous prime is 2020121273. The next prime is 2020121317. The reversal of 2020121313 is 3131210202.
It is not a de Polignac number, because 2020121313 - 28 = 2020121057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2020121292 and 2020121301.
It is not an unprimeable number, because it can be changed into a prime (2020121317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 577753 + ... + 581238.
It is an arithmetic number, because the mean of its divisors is an integer number (194710656).
Almost surely, 22020121313 is an apocalyptic number.
It is an amenable number.
2020121313 is a deficient number, since it is larger than the sum of its proper divisors (1095249183).
2020121313 is a wasteful number, since it uses less digits than its factorization.
2020121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159084.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2020121313 is about 44945.7596776381. The cubic root of 2020121313 is about 1264.1321700656.
Adding to 2020121313 its reverse (3131210202), we get a palindrome (5151331515).
Subtracting 2020121313 from its reverse (3131210202), we obtain a square (1111088889 = 333332).
It can be divided in two parts, 20201 and 21313, that added together give a palindrome (41514).
The spelling of 2020121313 in words is "two billion, twenty million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •