Base | Representation |
---|---|
bin | 111100100011010010… |
… | …0111100101111110000 |
3 | 110102122020020102000010 |
4 | 1321012210330233300 |
5 | 4112301434010000 |
6 | 135423020454520 |
7 | 12252225124653 |
oct | 1710644745760 |
9 | 412566212003 |
10 | 130033110000 |
11 | 50168334172 |
12 | 2124b9aa440 |
13 | c3539c8251 |
14 | 6417a4789a |
15 | 35b0c03d50 |
hex | 1e4693cbf0 |
130033110000 has 200 divisors, whose sum is σ = 422797661440. Its totient is φ = 34424928000.
The previous prime is 130033109989. The next prime is 130033110013. The reversal of 130033110000 is 11330031.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4154409 + ... + 4185591.
Almost surely, 2130033110000 is an apocalyptic number.
130033110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130033110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211398830720).
130033110000 is an abundant number, since it is smaller than the sum of its proper divisors (292764551440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130033110000 is a wasteful number, since it uses less digits than its factorization.
130033110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31353 (or 31332 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 130033110000 its reverse (11330031), we get a palindrome (130044440031).
The spelling of 130033110000 in words is "one hundred thirty billion, thirty-three million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •