Base | Representation |
---|---|
bin | 11110000101001110001101… |
… | …000100100110000000100000 |
3 | 122100102210001111200111112001 |
4 | 132011032031010212000200 |
5 | 114320101400032113100 |
6 | 1145213520534413344 |
7 | 36603243250454023 |
oct | 3605161504460040 |
9 | 570383044614461 |
10 | 132300244410400 |
11 | 39178244a00480 |
12 | 12a08810201254 |
13 | 58a8b234815a1 |
14 | 249551a4131ba |
15 | 1046676412d6a |
hex | 78538d126020 |
132300244410400 has 72 divisors (see below), whose sum is σ = 352339605478224. Its totient is φ = 48109179782400.
The previous prime is 132300244410377. The next prime is 132300244410469. The reversal of 132300244410400 is 4014442003231.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7517050542 + ... + 7517068141.
It is an arithmetic number, because the mean of its divisors is an integer number (4893605631642).
Almost surely, 2132300244410400 is an apocalyptic number.
132300244410400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132300244410400 is an abundant number, since it is smaller than the sum of its proper divisors (220039361067824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132300244410400 is a wasteful number, since it uses less digits than its factorization.
132300244410400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15034118714 (or 15034118701 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 132300244410400 its reverse (4014442003231), we get a palindrome (136314686413631).
The spelling of 132300244410400 in words is "one hundred thirty-two trillion, three hundred billion, two hundred forty-four million, four hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •