Base | Representation |
---|---|
bin | 11101000110111011110… |
… | …101000001000100001111 |
3 | 21002020011010002210221212 |
4 | 131012323311001010033 |
5 | 230233114110430111 |
6 | 4130532531245035 |
7 | 264342400134116 |
oct | 35067365010417 |
9 | 7066133083855 |
10 | 2000311030031 |
11 | 7013664792a6 |
12 | 28381014977b |
13 | 116822b24802 |
14 | 6cb5bcd4c7d |
15 | 3707546998b |
hex | 1d1bbd4110f |
2000311030031 has 4 divisors (see below), whose sum is σ = 2000385525864. Its totient is φ = 2000236534200.
The previous prime is 2000311030013. The next prime is 2000311030033. The reversal of 2000311030031 is 1300301130002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000311030031 is a prime.
It is a super-2 number, since 2×20003110300312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000311029988 and 2000311030015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000311030033) 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, 37207625 + ... + 37261346.
It is an arithmetic number, because the mean of its divisors is an integer number (500096381466).
Almost surely, 22000311030031 is an apocalyptic number.
2000311030031 is a deficient number, since it is larger than the sum of its proper divisors (74495833).
2000311030031 is an equidigital number, since it uses as much as digits as its factorization.
2000311030031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74495832.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 2000311030031 its reverse (1300301130002), we get a palindrome (3300612160033).
The spelling of 2000311030031 in words is "two trillion, three hundred eleven million, thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •