Base | Representation |
---|---|
bin | 101010011110111… |
… | …1100011000000111 |
3 | 10200100101010121202 |
4 | 1110331330120013 |
5 | 10404413233411 |
6 | 353241533115 |
7 | 50216520215 |
oct | 12475743007 |
9 | 3610333552 |
10 | 1425524231 |
11 | 6717424aa |
12 | 3394a419b |
13 | 199447481 |
14 | d7477cb5 |
15 | 8523783b |
hex | 54f7c607 |
1425524231 has 2 divisors, whose sum is σ = 1425524232. Its totient is φ = 1425524230.
The previous prime is 1425524207. The next prime is 1425524237. The reversal of 1425524231 is 1324255241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1425524231 - 230 = 351782407 is a prime.
It is a super-2 number, since 2×14255242312 = 4064238666336282722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1425524194 and 1425524203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1425524237) 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, 712762115 + 712762116.
It is an arithmetic number, because the mean of its divisors is an integer number (712762116).
Almost surely, 21425524231 is an apocalyptic number.
1425524231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1425524231 is an equidigital number, since it uses as much as digits as its factorization.
1425524231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9600, while the sum is 29.
The square root of 1425524231 is about 37756.1151470858. The cubic root of 1425524231 is about 1125.4465337841.
Adding to 1425524231 its reverse (1324255241), we get a palindrome (2749779472).
The spelling of 1425524231 in words is "one billion, four hundred twenty-five million, five hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •