Base | Representation |
---|---|
bin | 111100101000111001… |
… | …0001001101100101100 |
3 | 110110010100000022122120 |
4 | 1321101302021230230 |
5 | 4113143101322200 |
6 | 135453414312540 |
7 | 12260000154645 |
oct | 1712162115454 |
9 | 413110008576 |
10 | 130221120300 |
11 | 50254478087 |
12 | 212a2958750 |
13 | c38394514b |
14 | 64349c86cc |
15 | 35c24909a0 |
hex | 1e51c89b2c |
130221120300 has 144 divisors (see below), whose sum is σ = 411805642752. Its totient is φ = 31628620800.
The previous prime is 130221120241. The next prime is 130221120301. The reversal of 130221120300 is 3021122031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 130221120300.
It is not an unprimeable number, because it can be changed into a prime (130221120301) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 253732 + ... + 569931.
It is an arithmetic number, because the mean of its divisors is an integer number (2859761408).
Almost surely, 2130221120300 is an apocalyptic number.
130221120300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130221120300 is an abundant number, since it is smaller than the sum of its proper divisors (281584522452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130221120300 is a wasteful number, since it uses less digits than its factorization.
130221120300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 823728 (or 823721 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 130221120300 its reverse (3021122031), we get a palindrome (133242242331).
The spelling of 130221120300 in words is "one hundred thirty billion, two hundred twenty-one million, one hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •