Base | Representation |
---|---|
bin | 11101000110111011110… |
… | …010010001010010000101 |
3 | 21002020011001202020021211 |
4 | 131012323302101102011 |
5 | 230233113414410041 |
6 | 4130532504011421 |
7 | 264342361045012 |
oct | 35067362212205 |
9 | 7066131666254 |
10 | 2000310310021 |
11 | 701366027351 |
12 | 28380ba60b71 |
13 | 116822931b7a |
14 | 6cb5bb88709 |
15 | 37075376481 |
hex | 1d1bbc91485 |
2000310310021 has 4 divisors (see below), whose sum is σ = 2000398456000. Its totient is φ = 2000222164044.
The previous prime is 2000310310003. The next prime is 2000310310091. The reversal of 2000310310021 is 1200130130002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000310310021 - 221 = 2000308212869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000310309983 and 2000310310010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000310310091) 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, 44038941 + ... + 44084338.
It is an arithmetic number, because the mean of its divisors is an integer number (500099614000).
Almost surely, 22000310310021 is an apocalyptic number.
It is an amenable number.
2000310310021 is a deficient number, since it is larger than the sum of its proper divisors (88145979).
2000310310021 is an equidigital number, since it uses as much as digits as its factorization.
2000310310021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88145978.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 2000310310021 its reverse (1200130130002), we get a palindrome (3200440440023).
The spelling of 2000310310021 in words is "two trillion, three hundred ten million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •