Base | Representation |
---|---|
bin | 11110000111011010000110… |
… | …111101001001000001000110 |
3 | 122100222010210200110002022002 |
4 | 132013122012331021001012 |
5 | 114330032023201224320 |
6 | 1145410523125105302 |
7 | 36620142004066646 |
oct | 3607320675110106 |
9 | 570863720402262 |
10 | 132450465648710 |
11 | 39225a21978200 |
12 | 12a31954b58232 |
13 | 58ba043812c91 |
14 | 249c8cb314526 |
15 | 104a519644675 |
hex | 787686f49046 |
132450465648710 has 96 divisors (see below), whose sum is σ = 280839083345856. Its totient is φ = 44824599072000.
The previous prime is 132450465648703. The next prime is 132450465648719. The reversal of 132450465648710 is 17846564054231.
It is a super-2 number, since 2×1324504656487102 (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 (132450465648719) 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, 63284741 + ... + 65344160.
It is an arithmetic number, because the mean of its divisors is an integer number (2925407118186).
Almost surely, 2132450465648710 is an apocalyptic number.
132450465648710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132450465648710 is an abundant number, since it is smaller than the sum of its proper divisors (148388617697146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132450465648710 is a wasteful number, since it uses less digits than its factorization.
132450465648710 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128628990 (or 128628979 counting only the distinct ones).
The product of its (nonzero) digits is 19353600, while the sum is 56.
The spelling of 132450465648710 in words is "one hundred thirty-two trillion, four hundred fifty billion, four hundred sixty-five million, six hundred forty-eight thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •