Base | Representation |
---|---|
bin | 11011101010111… |
… | …10001100011101 |
3 | 121011202222022102 |
4 | 31311132030131 |
5 | 433410333432 |
6 | 35011054445 |
7 | 5515665644 |
oct | 1565361435 |
9 | 534688272 |
10 | 232121117 |
11 | 10a032038 |
12 | 658a1425 |
13 | 39122897 |
14 | 22b8435b |
15 | 155a1962 |
hex | dd5e31d |
232121117 has 2 divisors, whose sum is σ = 232121118. Its totient is φ = 232121116.
The previous prime is 232121101. The next prime is 232121137. The reversal of 232121117 is 711121232.
It is an a-pointer prime, because the next prime (232121137) can be obtained adding 232121117 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130736356 + 101384761 = 11434^2 + 10069^2 .
It is a cyclic number.
It is not a de Polignac number, because 232121117 - 24 = 232121101 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232121137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116060558 + 116060559.
It is an arithmetic number, because the mean of its divisors is an integer number (116060559).
Almost surely, 2232121117 is an apocalyptic number.
It is an amenable number.
232121117 is a deficient number, since it is larger than the sum of its proper divisors (1).
232121117 is an equidigital number, since it uses as much as digits as its factorization.
232121117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 168, while the sum is 20.
The square root of 232121117 is about 15235.5215532649. The cubic root of 232121117 is about 614.5702746377.
Adding to 232121117 its reverse (711121232), we get a palindrome (943242349).
The spelling of 232121117 in words is "two hundred thirty-two million, one hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •