Base | Representation |
---|---|
bin | 1000011001100001… |
… | …0100010001010111 |
3 | 12211010021112222202 |
4 | 2012120110101113 |
5 | 14104124141211 |
6 | 1011414115115 |
7 | 106604054531 |
oct | 20630242127 |
9 | 5733245882 |
10 | 2254521431 |
11 | a57689358 |
12 | 52b04ba9b |
13 | 29c110a66 |
14 | 1755d0851 |
15 | d2ddb53b |
hex | 86614457 |
2254521431 has 2 divisors, whose sum is σ = 2254521432. Its totient is φ = 2254521430.
The previous prime is 2254521383. The next prime is 2254521439. The reversal of 2254521431 is 1341254522.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2254521431 is a prime.
It is a super-2 number, since 2×22545214312 = 10165733765676575522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2254521394 and 2254521403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2254521439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1127260715 + 1127260716.
It is an arithmetic number, because the mean of its divisors is an integer number (1127260716).
Almost surely, 22254521431 is an apocalyptic number.
2254521431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2254521431 is an equidigital number, since it uses as much as digits as its factorization.
2254521431 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 2254521431 is about 47481.8010505078. The cubic root of 2254521431 is about 1311.2478506558.
Adding to 2254521431 its reverse (1341254522), we get a palindrome (3595775953).
The spelling of 2254521431 in words is "two billion, two hundred fifty-four million, five hundred twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •