Base | Representation |
---|---|
bin | 111101101010100010… |
… | …1100110001111001111 |
3 | 110122210212011220002101 |
4 | 1323111011212033033 |
5 | 4132201023030411 |
6 | 140500150335531 |
7 | 12365406465430 |
oct | 1732505461717 |
9 | 418725156071 |
10 | 132424033231 |
11 | 51184a07186 |
12 | 217b865a5a7 |
13 | c645156619 |
14 | 65a33c3487 |
15 | 36a0a858c1 |
hex | 1ed51663cf |
132424033231 has 8 divisors (see below), whose sum is σ = 151353442304. Its totient is φ = 113497546680.
The previous prime is 132424033211. The next prime is 132424033237. The reversal of 132424033231 is 132330424231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132424033231 - 211 = 132424031183 is a prime.
It is a super-2 number, since 2×1324240332312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132424033231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132424033237) 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, 632655 + ... + 815536.
It is an arithmetic number, because the mean of its divisors is an integer number (18919180288).
Almost surely, 2132424033231 is an apocalyptic number.
132424033231 is a deficient number, since it is larger than the sum of its proper divisors (18929409073).
132424033231 is a wasteful number, since it uses less digits than its factorization.
132424033231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1461261.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 132424033231 its reverse (132330424231), we get a palindrome (264754457462).
The spelling of 132424033231 in words is "one hundred thirty-two billion, four hundred twenty-four million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •