Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …001101011111100000110 |
3 | 21002012212121012121010120 |
4 | 131012311121223330012 |
5 | 230232404004433220 |
6 | 4130514120202410 |
7 | 264336620460435 |
oct | 35066531537406 |
9 | 7065777177116 |
10 | 2000203202310 |
11 | 701310620785 |
12 | 2837a0009406 |
13 | 1168066a0121 |
14 | 6cb4b86711c |
15 | 3706ac6aa40 |
hex | 1d1b566bf06 |
2000203202310 has 32 divisors (see below), whose sum is σ = 4818740509440. Its totient is φ = 531359429088.
The previous prime is 2000203202303. The next prime is 2000203202423. The reversal of 2000203202310 is 132023020002.
It is a super-2 number, since 2×20002032023102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2000203202310.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 126747700 + ... + 126763479.
It is an arithmetic number, because the mean of its divisors is an integer number (150585640920).
Almost surely, 22000203202310 is an apocalyptic number.
2000203202310 is an abundant number, since it is smaller than the sum of its proper divisors (2818537307130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000203202310 is a wasteful number, since it uses less digits than its factorization.
2000203202310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253511452.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2000203202310 its reverse (132023020002), we get a palindrome (2132226222312).
The spelling of 2000203202310 in words is "two trillion, two hundred three million, two hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •