Base | Representation |
---|---|
bin | 100100110101100101000… |
… | …000110100110001100001 |
3 | 22222000001201222222021022 |
4 | 210311211000310301201 |
5 | 312433332143433241 |
6 | 5214531215535225 |
7 | 350614130550251 |
oct | 44654500646141 |
9 | 8860051888238 |
10 | 2531430452321 |
11 | 896634550311 |
12 | 34a736b2a515 |
13 | 154936228814 |
14 | 8a7440b9961 |
15 | 45cad0e754b |
hex | 24d65034c61 |
2531430452321 has 2 divisors, whose sum is σ = 2531430452322. Its totient is φ = 2531430452320.
The previous prime is 2531430452269. The next prime is 2531430452371. The reversal of 2531430452321 is 1232540341352.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2268096240400 + 263334211921 = 1506020^2 + 513161^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2531430452321 is a prime.
It is not a weakly prime, because it can be changed into another prime (2531430452371) 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, 1265715226160 + 1265715226161.
It is an arithmetic number, because the mean of its divisors is an integer number (1265715226161).
Almost surely, 22531430452321 is an apocalyptic number.
It is an amenable number.
2531430452321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2531430452321 is an equidigital number, since it uses as much as digits as its factorization.
2531430452321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 2531430452321 its reverse (1232540341352), we get a palindrome (3763970793673).
The spelling of 2531430452321 in words is "two trillion, five hundred thirty-one billion, four hundred thirty million, four hundred fifty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •