Base | Representation |
---|---|
bin | 111100001101100… |
… | …0101100100100111 |
3 | 12012210200020222202 |
4 | 1320123011210213 |
5 | 13114203213011 |
6 | 532251245115 |
7 | 101031555503 |
oct | 17033054447 |
9 | 5183606882 |
10 | 2020366631 |
11 | 947498398 |
12 | 48474979b |
13 | 26275861a |
14 | 15247b303 |
15 | bc58723b |
hex | 786c5927 |
2020366631 has 4 divisors (see below), whose sum is σ = 2020627392. Its totient is φ = 2020105872.
The previous prime is 2020366613. The next prime is 2020366679. The reversal of 2020366631 is 1366630202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2020366631 - 214 = 2020350247 is a prime.
It is a super-2 number, since 2×20203666312 = 8163762647316580322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020366594 and 2020366603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020366331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 118391 + ... + 134376.
It is an arithmetic number, because the mean of its divisors is an integer number (505156848).
Almost surely, 22020366631 is an apocalyptic number.
2020366631 is a deficient number, since it is larger than the sum of its proper divisors (260761).
2020366631 is an equidigital number, since it uses as much as digits as its factorization.
2020366631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260760.
The product of its (nonzero) digits is 7776, while the sum is 29.
The square root of 2020366631 is about 44948.4886397752. The cubic root of 2020366631 is about 1264.1833389107.
Adding to 2020366631 its reverse (1366630202), we get a palindrome (3386996833).
The spelling of 2020366631 in words is "two billion, twenty million, three hundred sixty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •