Base | Representation |
---|---|
bin | 111101101101110010… |
… | …1101101011000111111 |
3 | 110200002110102210100211 |
4 | 1323123211231120333 |
5 | 4132411434130211 |
6 | 140515044333251 |
7 | 12401202612424 |
oct | 1733345553077 |
9 | 420073383324 |
10 | 132533114431 |
11 | 51230540533 |
12 | 218290a4227 |
13 | c661929703 |
14 | 65b3a99d4b |
15 | 36aa430e21 |
hex | 1edb96d63f |
132533114431 has 8 divisors (see below), whose sum is σ = 132875971200. Its totient is φ = 132190384920.
The previous prime is 132533114411. The next prime is 132533114443. The reversal of 132533114431 is 134411335231.
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 132533114431 - 213 = 132533106239 is a prime.
It is a super-2 number, since 2×1325331144312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132533114393 and 132533114402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132533114411) 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, 2266836 + ... + 2324566.
It is an arithmetic number, because the mean of its divisors is an integer number (16609496400).
Almost surely, 2132533114431 is an apocalyptic number.
132533114431 is a deficient number, since it is larger than the sum of its proper divisors (342856769).
132533114431 is an equidigital number, since it uses as much as digits as its factorization.
132533114431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63629.
The product of its digits is 12960, while the sum is 31.
Adding to 132533114431 its reverse (134411335231), we get a palindrome (266944449662).
The spelling of 132533114431 in words is "one hundred thirty-two billion, five hundred thirty-three million, one hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •