Base | Representation |
---|---|
bin | 1111110000000… |
… | …00011101000001 |
3 | 100012121111220110 |
4 | 13320000131001 |
5 | 232310404213 |
6 | 21035501533 |
7 | 3163010412 |
oct | 770003501 |
9 | 305544813 |
10 | 132122433 |
11 | 686415a3 |
12 | 382b78a9 |
13 | 214ac871 |
14 | 13793809 |
15 | b8ec5c3 |
hex | 7e00741 |
132122433 has 8 divisors (see below), whose sum is σ = 177330496. Its totient is φ = 87498000.
The previous prime is 132122429. The next prime is 132122437. The reversal of 132122433 is 334221231.
It is an interprime number because it is at equal distance from previous prime (132122429) and next prime (132122437).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132122433 - 22 = 132122429 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132122437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145378 + ... + 146283.
It is an arithmetic number, because the mean of its divisors is an integer number (22166312).
Almost surely, 2132122433 is an apocalyptic number.
It is an amenable number.
132122433 is a deficient number, since it is larger than the sum of its proper divisors (45208063).
132122433 is a wasteful number, since it uses less digits than its factorization.
132122433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291815.
The product of its digits is 864, while the sum is 21.
The square root of 132122433 is about 11494.4522705521. The cubic root of 132122433 is about 509.3217088188.
Adding to 132122433 its reverse (334221231), we get a palindrome (466343664).
The spelling of 132122433 in words is "one hundred thirty-two million, one hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •