Base | Representation |
---|---|
bin | 11110000001001010001100… |
… | …000001111001011100011101 |
3 | 122022110002102020202210200020 |
4 | 132001022030001321130131 |
5 | 114301013104314132000 |
6 | 1144441345052222353 |
7 | 36544130535536640 |
oct | 3601121401713435 |
9 | 568402366683606 |
10 | 132021054052125 |
11 | 3907a8a6259a97 |
12 | 12982693a6a9b9 |
13 | 58886bb9a7c64 |
14 | 2485bd2d11a57 |
15 | 103e285aedba0 |
hex | 78128c07971d |
132021054052125 has 128 divisors (see below), whose sum is σ = 255235321036800. Its totient is φ = 59350731552000.
The previous prime is 132021054052087. The next prime is 132021054052127. The reversal of 132021054052125 is 521250450120231.
It is not a de Polignac number, because 132021054052125 - 26 = 132021054052061 is a prime.
It is a super-2 number, since 2×1320210540521252 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132021054052127) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 791414476 + ... + 791581274.
It is an arithmetic number, because the mean of its divisors is an integer number (1994025945600).
Almost surely, 2132021054052125 is an apocalyptic number.
132021054052125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132021054052125 is a deficient number, since it is larger than the sum of its proper divisors (123214266984675).
132021054052125 is a wasteful number, since it uses less digits than its factorization.
132021054052125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171828 (or 171818 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 33.
The spelling of 132021054052125 in words is "one hundred thirty-two trillion, twenty-one billion, fifty-four million, fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •