Base | Representation |
---|---|
bin | 11101000110111101000… |
… | …101001000110001100100 |
3 | 21002020012120121212210012 |
4 | 131012331011020301210 |
5 | 230233140000024444 |
6 | 4130535001345352 |
7 | 264343043511455 |
oct | 35067505106144 |
9 | 7066176555705 |
10 | 2000332033124 |
11 | 701377314227 |
12 | 283817198258 |
13 | 116827299689 |
14 | 6cb60a0112c |
15 | 37077217b9e |
hex | 1d1bd148c64 |
2000332033124 has 24 divisors (see below), whose sum is σ = 3508646803200. Its totient is φ = 997863636224.
The previous prime is 2000332033121. The next prime is 2000332033127. The reversal of 2000332033124 is 4213302330002.
It is an interprime number because it is at equal distance from previous prime (2000332033121) and next prime (2000332033127).
It is a self number, because there is not a number n which added to its sum of digits gives 2000332033124.
It is not an unprimeable number, because it can be changed into a prime (2000332033121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3529172 + ... + 4056564.
It is an arithmetic number, because the mean of its divisors is an integer number (146193616800).
Almost surely, 22000332033124 is an apocalyptic number.
It is an amenable number.
2000332033124 is a deficient number, since it is larger than the sum of its proper divisors (1508314770076).
2000332033124 is a wasteful number, since it uses less digits than its factorization.
2000332033124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529579 (or 529577 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 2000332033124 its reverse (4213302330002), we get a palindrome (6213634363126).
The spelling of 2000332033124 in words is "two trillion, three hundred thirty-two million, thirty-three thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •