Base | Representation |
---|---|
bin | 11101000110111101000… |
… | …110001100101001010011 |
3 | 21002020012121011000010110 |
4 | 131012331012030221103 |
5 | 230233140032423443 |
6 | 4130535011332403 |
7 | 264343046050116 |
oct | 35067506145123 |
9 | 7066177130113 |
10 | 2000332311123 |
11 | 701377494083 |
12 | 2838172b1103 |
13 | 116827366083 |
14 | 6cb60a7457d |
15 | 37077270233 |
hex | 1d1bd18ca53 |
2000332311123 has 8 divisors (see below), whose sum is σ = 2667831188368. Its totient is φ = 1333194153984.
The previous prime is 2000332311121. The next prime is 2000332311181. The reversal of 2000332311123 is 3211132330002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2000332311123 - 21 = 2000332311121 is a prime.
It is a super-2 number, since 2×20003323111232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000332311123.
It is not an unprimeable number, because it can be changed into a prime (2000332311121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90167086 + ... + 90189267.
It is an arithmetic number, because the mean of its divisors is an integer number (333478898546).
Almost surely, 22000332311123 is an apocalyptic number.
2000332311123 is a deficient number, since it is larger than the sum of its proper divisors (667498877245).
2000332311123 is a wasteful number, since it uses less digits than its factorization.
2000332311123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180360053.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2000332311123 its reverse (3211132330002), we get a palindrome (5211464641125).
The spelling of 2000332311123 in words is "two trillion, three hundred thirty-two million, three hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •