Base | Representation |
---|---|
bin | 11101000110101011010… |
… | …000011101011000011110 |
3 | 21002012102201221222212020 |
4 | 131012223100131120132 |
5 | 230232031422324410 |
6 | 4130445200321010 |
7 | 264332453044512 |
oct | 35065320353036 |
9 | 7065381858766 |
10 | 2000033011230 |
11 | 7012335486a1 |
12 | 283753013166 |
13 | 1167aa351b47 |
14 | 6cb33004142 |
15 | 3705ad4da70 |
hex | 1d1ab41d61e |
2000033011230 has 256 divisors, whose sum is σ = 5257171206144. Its totient is φ = 485592307200.
The previous prime is 2000033011217. The next prime is 2000033011267. The reversal of 2000033011230 is 321103300002.
It is a super-2 number, since 2×20000330112302 (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 congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 237444799 + ... + 237453221.
It is an arithmetic number, because the mean of its divisors is an integer number (20535825024).
Almost surely, 22000033011230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000033011230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2628585603072).
2000033011230 is an abundant number, since it is smaller than the sum of its proper divisors (3257138194914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000033011230 is a wasteful number, since it uses less digits than its factorization.
2000033011230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8703.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 2000033011230 its reverse (321103300002), we get a palindrome (2321136311232).
The spelling of 2000033011230 in words is "two trillion, thirty-three million, eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •