Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …011111011001011000111 |
3 | 21011002222111000120212010 |
4 | 131121101203323023013 |
5 | 231043431232013111 |
6 | 4143550534425303 |
7 | 265640362131231 |
oct | 35312143731307 |
9 | 7132874016763 |
10 | 2020003001031 |
11 | 70975103a5a4 |
12 | 2875a6b02233 |
13 | 11864074cc62 |
14 | 6daa9317251 |
15 | 3782913caa6 |
hex | 1d6518fb2c7 |
2020003001031 has 32 divisors (see below), whose sum is σ = 2870443699200. Its totient is φ = 1259178117120.
The previous prime is 2020003001017. The next prime is 2020003001053. The reversal of 2020003001031 is 1301003000202.
It is a happy number.
It is not a de Polignac number, because 2020003001031 - 27 = 2020003000903 is a prime.
It is a super-2 number, since 2×20200030010312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2020003000998 and 2020003001016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020003006031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4953810 + ... + 5346048.
It is an arithmetic number, because the mean of its divisors is an integer number (89701365600).
Almost surely, 22020003001031 is an apocalyptic number.
2020003001031 is a deficient number, since it is larger than the sum of its proper divisors (850440698169).
2020003001031 is a wasteful number, since it uses less digits than its factorization.
2020003001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392919.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 2020003001031 its reverse (1301003000202), we get a palindrome (3321006001233).
The spelling of 2020003001031 in words is "two trillion, twenty billion, three million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •