Base | Representation |
---|---|
bin | 111100101000100111… |
… | …1011111000111101000 |
3 | 110110002200220122012220 |
4 | 1321101033133013220 |
5 | 4113133240024000 |
6 | 135452451434040 |
7 | 12256530006240 |
oct | 1712117370750 |
9 | 413080818186 |
10 | 130212033000 |
11 | 5024a330715 |
12 | 2129b8b5920 |
13 | c381ab2b4a |
14 | 6433700b20 |
15 | 35c17981a0 |
hex | 1e513df1e8 |
130212033000 has 256 divisors, whose sum is σ = 464833175040. Its totient is φ = 29728512000.
The previous prime is 130212032971. The next prime is 130212033047. The reversal of 130212033000 is 330212031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21269940 + ... + 21276060.
It is an arithmetic number, because the mean of its divisors is an integer number (1815754590).
Almost surely, 2130212033000 is an apocalyptic number.
130212033000 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 130212033000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232416587520).
130212033000 is an abundant number, since it is smaller than the sum of its proper divisors (334621142040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130212033000 is a wasteful number, since it uses less digits than its factorization.
130212033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7165 (or 7151 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 130212033000 its reverse (330212031), we get a palindrome (130542245031).
The spelling of 130212033000 in words is "one hundred thirty billion, two hundred twelve million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •