Base | Representation |
---|---|
bin | 11110000001001001010011… |
… | …110101010010011000011100 |
3 | 122022102222222112200002022002 |
4 | 132001021103311102120130 |
5 | 114301004141433103200 |
6 | 1144441111332141432 |
7 | 36544065266605640 |
oct | 3601112365223034 |
9 | 568388875602262 |
10 | 132020111222300 |
11 | 3907a462033a94 |
12 | 12982470167878 |
13 | 588859b5669a2 |
14 | 2485b43a06c20 |
15 | 103e22ce61bd5 |
hex | 781253d5261c |
132020111222300 has 72 divisors (see below), whose sum is σ = 327411964876416. Its totient is φ = 45263749325760.
The previous prime is 132020111222249. The next prime is 132020111222309. The reversal of 132020111222300 is 3222111020231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132020111222309) 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, 129161039 + ... + 130179161.
Almost surely, 2132020111222300 is an apocalyptic number.
132020111222300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132020111222300 is an abundant number, since it is smaller than the sum of its proper divisors (195391853654116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132020111222300 is a wasteful number, since it uses less digits than its factorization.
132020111222300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203387 (or 1203380 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 132020111222300 its reverse (3222111020231), we get a palindrome (135242222242531).
The spelling of 132020111222300 in words is "one hundred thirty-two trillion, twenty billion, one hundred eleven million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •