Base | Representation |
---|---|
bin | 111100001101011… |
… | …1111001110010111 |
3 | 12012210121221022210 |
4 | 1320122333032113 |
5 | 13114201400011 |
6 | 532250524503 |
7 | 101031416631 |
oct | 17032771627 |
9 | 5183557283 |
10 | 2020340631 |
11 | 94747a901 |
12 | 484736733 |
13 | 26274983a |
14 | 152471a51 |
15 | bc57e6a6 |
hex | 786bf397 |
2020340631 has 8 divisors (see below), whose sum is σ = 2810908800. Its totient is φ = 1288333112.
The previous prime is 2020340611. The next prime is 2020340657. The reversal of 2020340631 is 1360430202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020340631 - 213 = 2020332439 is a prime.
It is a super-2 number, since 2×20203406312 = 8163552530538956322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2020340598 and 2020340607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020340611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14640081 + ... + 14640218.
It is an arithmetic number, because the mean of its divisors is an integer number (351363600).
Almost surely, 22020340631 is an apocalyptic number.
2020340631 is a deficient number, since it is larger than the sum of its proper divisors (790568169).
2020340631 is a wasteful number, since it uses less digits than its factorization.
2020340631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29280325.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 2020340631 is about 44948.1994188866. The cubic root of 2020340631 is about 1264.1779159828.
Adding to 2020340631 its reverse (1360430202), we get a palindrome (3380770833).
The spelling of 2020340631 in words is "two billion, twenty million, three hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •