Base | Representation |
---|---|
bin | 1111010010110010000011… |
… | …11011011011000101000000 |
3 | 11102002001201022022220101010 |
4 | 13221121001323123011000 |
5 | 13402001133201233003 |
6 | 155305421425040520 |
7 | 10040511045401664 |
oct | 751310173330500 |
9 | 142061638286333 |
10 | 33630700024128 |
11 | a79677745a899 |
12 | 3931a31486140 |
13 | 159c49100baac |
14 | 843a3d9148a4 |
15 | 3d4c2968e003 |
hex | 1e9641edb140 |
33630700024128 has 168 divisors, whose sum is σ = 90935539402624. Its totient is φ = 10969206220800.
The previous prime is 33630700024127. The next prime is 33630700024139. The reversal of 33630700024128 is 82142000703633.
It is a super-2 number, since 2×336307000241282 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33630700024127) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3105035673 + ... + 3105046503.
Almost surely, 233630700024128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 33630700024128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45467769701312).
33630700024128 is an abundant number, since it is smaller than the sum of its proper divisors (57304839378496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33630700024128 is a wasteful number, since it uses less digits than its factorization.
33630700024128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18261 (or 18204 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 39.
The spelling of 33630700024128 in words is "thirty-three trillion, six hundred thirty billion, seven hundred million, twenty-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •