Base | Representation |
---|---|
bin | 11110000010011111111110… |
… | …000011110011001001010011 |
3 | 122022202220011101010020210000 |
4 | 132002133332003303021103 |
5 | 114304020223313411301 |
6 | 1144551540513541043 |
7 | 36553601204620404 |
oct | 3602377603631123 |
9 | 568686141106700 |
10 | 132113161466451 |
11 | 39105971512710 |
12 | 129984ba574783 |
13 | 58942aa2b2a59 |
14 | 248a44da699ab |
15 | 1041876ea9786 |
hex | 7827fe0f3253 |
132113161466451 has 80 divisors (see below), whose sum is σ = 229977312684768. Its totient is φ = 74691774259200.
The previous prime is 132113161466413. The next prime is 132113161466459. The reversal of 132113161466451 is 154664161311231.
It is a happy number.
132113161466451 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 131 + 6 + 1 + 4 + 66 + 451 = 666.
It is not a de Polignac number, because 132113161466451 - 27 = 132113161466323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132113161466397 and 132113161466406.
It is not an unprimeable number, because it can be changed into a prime (132113161466459) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 36881610 + ... + 40304831.
Almost surely, 2132113161466451 is an apocalyptic number.
132113161466451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132113161466451 is a deficient number, since it is larger than the sum of its proper divisors (97864151218317).
132113161466451 is a wasteful number, since it uses less digits than its factorization.
132113161466451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77186594 (or 77186585 counting only the distinct ones).
The product of its digits is 311040, while the sum is 45.
The spelling of 132113161466451 in words is "one hundred thirty-two trillion, one hundred thirteen billion, one hundred sixty-one million, four hundred sixty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •