Base | Representation |
---|---|
bin | 111101011110101000… |
… | …1001111110111000101 |
3 | 110121210000021011011012 |
4 | 1322331101033313011 |
5 | 4130341223342432 |
6 | 140352353452005 |
7 | 12352455113432 |
oct | 1727521176705 |
9 | 417700234135 |
10 | 132024434117 |
11 | 50a9a395484 |
12 | 21706871005 |
13 | c5b0425644 |
14 | 65662c4b89 |
15 | 367a950cb2 |
hex | 1ebd44fdc5 |
132024434117 has 2 divisors, whose sum is σ = 132024434118. Its totient is φ = 132024434116.
The previous prime is 132024434089. The next prime is 132024434119. The reversal of 132024434117 is 711434420231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120788222116 + 11236212001 = 347546^2 + 106001^2 .
It is a cyclic number.
It is not a de Polignac number, because 132024434117 - 26 = 132024434053 is a prime.
Together with 132024434119, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132024434119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66012217058 + 66012217059.
It is an arithmetic number, because the mean of its divisors is an integer number (66012217059).
Almost surely, 2132024434117 is an apocalyptic number.
It is an amenable number.
132024434117 is a deficient number, since it is larger than the sum of its proper divisors (1).
132024434117 is an equidigital number, since it uses as much as digits as its factorization.
132024434117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 32.
Adding to 132024434117 its reverse (711434420231), we get a palindrome (843458854348).
The spelling of 132024434117 in words is "one hundred thirty-two billion, twenty-four million, four hundred thirty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •