Base | Representation |
---|---|
bin | 11110000001101010010010… |
… | …100111001010010111000101 |
3 | 122022120101101112110212212120 |
4 | 132001222102213022113011 |
5 | 114302044203200104110 |
6 | 1144505245331440153 |
7 | 36546460665260130 |
oct | 3601522247122705 |
9 | 568511345425776 |
10 | 132055524222405 |
11 | 3909348481a123 |
12 | 129892b3a56059 |
13 | 588ba23201214 |
14 | 2487742cdd217 |
15 | 1040101dc2870 |
hex | 781a929ca5c5 |
132055524222405 has 16 divisors (see below), whose sum is σ = 241472958578304. Its totient is φ = 60368239644480.
The previous prime is 132055524222379. The next prime is 132055524222443. The reversal of 132055524222405 is 504222425550231.
It is not a de Polignac number, because 132055524222405 - 27 = 132055524222277 is a prime.
It is a super-2 number, since 2×1320555242224052 (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, 628835829526 + ... + 628835829735.
It is an arithmetic number, because the mean of its divisors is an integer number (15092059911144).
Almost surely, 2132055524222405 is an apocalyptic number.
132055524222405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132055524222405 is a deficient number, since it is larger than the sum of its proper divisors (109417434355899).
132055524222405 is a wasteful number, since it uses less digits than its factorization.
132055524222405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1257671659276.
The product of its (nonzero) digits is 960000, while the sum is 42.
Adding to 132055524222405 its reverse (504222425550231), we get a palindrome (636277949772636).
The spelling of 132055524222405 in words is "one hundred thirty-two trillion, fifty-five billion, five hundred twenty-four million, two hundred twenty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •