Base | Representation |
---|---|
bin | 11110000100100011010001… |
… | …101010101101110110111100 |
3 | 122100021101002011002001111122 |
4 | 132010203101222231312330 |
5 | 114313323000024130320 |
6 | 1145140415032410112 |
7 | 36600022066612220 |
oct | 3604432152556674 |
9 | 570241064061448 |
10 | 132254150614460 |
11 | 3915a741188346 |
12 | 129bb8a7546938 |
13 | 58a4688a82614 |
14 | 24931c67bc780 |
15 | 1045379966d25 |
hex | 7848d1aaddbc |
132254150614460 has 48 divisors (see below), whose sum is σ = 324163364926464. Its totient is φ = 44379508289088.
The previous prime is 132254150614429. The next prime is 132254150614471. The reversal of 132254150614460 is 64416051452231.
It is a happy number.
It is a super-2 number, since 2×1322541506144602 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10049700914 + ... + 10049714073.
It is an arithmetic number, because the mean of its divisors is an integer number (6753403435968).
Almost surely, 2132254150614460 is an apocalyptic number.
132254150614460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132254150614460 is an abundant number, since it is smaller than the sum of its proper divisors (191909214312004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132254150614460 is a wasteful number, since it uses less digits than its factorization.
132254150614460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20099415050 (or 20099415048 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 44.
The spelling of 132254150614460 in words is "one hundred thirty-two trillion, two hundred fifty-four billion, one hundred fifty million, six hundred fourteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •