Base | Representation |
---|---|
bin | 11110000100001000101111… |
… | …000001101011010110010001 |
3 | 122100011122112001011201202101 |
4 | 132010020233001223112101 |
5 | 114312341113422043010 |
6 | 1145115343115320401 |
7 | 36564662631610114 |
oct | 3604105701532621 |
9 | 570148461151671 |
10 | 132225652143505 |
11 | 39149647579308 |
12 | 129b6273450101 |
13 | 58a1a967c675b |
14 | 2491a8195457b |
15 | 104475ca8a73a |
hex | 78422f06b591 |
132225652143505 has 8 divisors (see below), whose sum is σ = 161360117870400. Its totient is φ = 103987631516016.
The previous prime is 132225652143503. The next prime is 132225652143653. The reversal of 132225652143505 is 505341256522231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132225652143505 - 21 = 132225652143503 is a prime.
It is a super-2 number, since 2×1322256521435052 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132225652143503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224111274525 + ... + 224111275114.
It is an arithmetic number, because the mean of its divisors is an integer number (20170014733800).
Almost surely, 2132225652143505 is an apocalyptic number.
It is an amenable number.
132225652143505 is a deficient number, since it is larger than the sum of its proper divisors (29134465726895).
132225652143505 is an equidigital number, since it uses as much as digits as its factorization.
132225652143505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448222549703.
The product of its (nonzero) digits is 2160000, while the sum is 46.
The spelling of 132225652143505 in words is "one hundred thirty-two trillion, two hundred twenty-five billion, six hundred fifty-two million, one hundred forty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •