Base | Representation |
---|---|
bin | 11110000110000110000101… |
… | …110100010110110101001001 |
3 | 122100122111221120000212210210 |
4 | 132012012011310112311021 |
5 | 114322042244034134221 |
6 | 1145301243243031333 |
7 | 36610466303644641 |
oct | 3606060564266511 |
9 | 570574846025723 |
10 | 132360252255561 |
11 | 391a0738856740 |
12 | 12a1837880b549 |
13 | 58b1697727585 |
14 | 24983add49521 |
15 | 1047ed96b5276 |
hex | 786185d16d49 |
132360252255561 has 64 divisors (see below), whose sum is σ = 200607213772800. Its totient is φ = 76899211814400.
The previous prime is 132360252255523. The next prime is 132360252255611. The reversal of 132360252255561 is 165552252063231.
It is a happy number.
It is not a de Polignac number, because 132360252255561 - 219 = 132360251731273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132360252255561.
It is not an unprimeable number, because it can be changed into a prime (132360252255661) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1710727285 + ... + 1710804653.
It is an arithmetic number, because the mean of its divisors is an integer number (3134487715200).
Almost surely, 2132360252255561 is an apocalyptic number.
132360252255561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132360252255561 is a deficient number, since it is larger than the sum of its proper divisors (68246961517239).
132360252255561 is a wasteful number, since it uses less digits than its factorization.
132360252255561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93150.
The product of its (nonzero) digits is 3240000, while the sum is 48.
The spelling of 132360252255561 in words is "one hundred thirty-two trillion, three hundred sixty billion, two hundred fifty-two million, two hundred fifty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •