Base | Representation |
---|---|
bin | 11110000000110111110011… |
… | …111011101100011100100000 |
3 | 122022101012111010020000221102 |
4 | 132000313303323230130200 |
5 | 114300202202014420000 |
6 | 1144424323111013532 |
7 | 36542531552455445 |
oct | 3600676373543440 |
9 | 568335433200842 |
10 | 132001322420000 |
11 | 390724a0269800 |
12 | 1297a8a796a2a8 |
13 | 5886895aa42a7 |
14 | 2484c805279cc |
15 | 103d9cd6e43d5 |
hex | 780df3eec720 |
132001322420000 has 180 divisors, whose sum is σ = 356948982541998. Its totient is φ = 48000480000000.
The previous prime is 132001322419909. The next prime is 132001322420017. The reversal of 132001322420000 is 24223100231.
It can be written as a sum of positive squares in 5 ways, for example, as 25057513039504 + 106943809380496 = 5005748^2 + 10341364^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 24853001 + ... + 29693000.
Almost surely, 2132001322420000 is an apocalyptic number.
132001322420000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132001322420000 is an abundant number, since it is smaller than the sum of its proper divisors (224947660121998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132001322420000 is an equidigital number, since it uses as much as digits as its factorization.
132001322420000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54546053 (or 54546019 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 132001322420000 its reverse (24223100231), we get a palindrome (132025545520231).
The spelling of 132001322420000 in words is "one hundred thirty-two trillion, one billion, three hundred twenty-two million, four hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •