Base | Representation |
---|---|
bin | 11110000100011… |
… | …11100110011111 |
3 | 122120122110001102 |
4 | 33002033212133 |
5 | 1004033341211 |
6 | 41010303315 |
7 | 6152026223 |
oct | 1702174637 |
9 | 576573042 |
10 | 252246431 |
11 | 11a428528 |
12 | 70587b3b |
13 | 4034b058 |
14 | 25702783 |
15 | 17229a3b |
hex | f08f99f |
252246431 has 2 divisors, whose sum is σ = 252246432. Its totient is φ = 252246430.
The previous prime is 252246403. The next prime is 252246433. The reversal of 252246431 is 134642252.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 252246431 - 218 = 251984287 is a prime.
It is a super-2 number, since 2×2522464312 = 127256523904475522, which contains 22 as substring.
Together with 252246433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 252246394 and 252246403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (252246433) 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, 126123215 + 126123216.
It is an arithmetic number, because the mean of its divisors is an integer number (126123216).
Almost surely, 2252246431 is an apocalyptic number.
252246431 is a deficient number, since it is larger than the sum of its proper divisors (1).
252246431 is an equidigital number, since it uses as much as digits as its factorization.
252246431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11520, while the sum is 29.
The square root of 252246431 is about 15882.2678166564. The cubic root of 252246431 is about 631.8417851234.
Adding to 252246431 its reverse (134642252), we get a palindrome (386888683).
The spelling of 252246431 in words is "two hundred fifty-two million, two hundred forty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •