Base | Representation |
---|---|
bin | 11001010101101… |
… | …011101001110111 |
3 | 1002121221001002112 |
4 | 121111223221313 |
5 | 1332312123411 |
6 | 110103401235 |
7 | 13351261043 |
oct | 3125535167 |
9 | 1077831075 |
10 | 425114231 |
11 | 1a8a69683 |
12 | ba45321b |
13 | 6a0c57a9 |
14 | 40661023 |
15 | 274c4b8b |
hex | 1956ba77 |
425114231 has 2 divisors, whose sum is σ = 425114232. Its totient is φ = 425114230.
The previous prime is 425114213. The next prime is 425114233. The reversal of 425114231 is 132411524.
Together with previous prime (425114213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 425114231 - 222 = 420919927 is a prime.
It is a super-2 number, since 2×4251142312 = 361444218797442722, which contains 22 as substring.
Together with 425114233, 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 = 425114197 and 425114206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425114233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212557115 + 212557116.
It is an arithmetic number, because the mean of its divisors is an integer number (212557116).
Almost surely, 2425114231 is an apocalyptic number.
425114231 is a deficient number, since it is larger than the sum of its proper divisors (1).
425114231 is an equidigital number, since it uses as much as digits as its factorization.
425114231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 960, while the sum is 23.
The square root of 425114231 is about 20618.2984506482. The cubic root of 425114231 is about 751.9146522791.
Adding to 425114231 its reverse (132411524), we get a palindrome (557525755).
The spelling of 425114231 in words is "four hundred twenty-five million, one hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •