Base | Representation |
---|---|
bin | 1000100111111110… |
… | …0011110111010001 |
3 | 12222100100022210201 |
4 | 2021333203313101 |
5 | 14220133444221 |
6 | 1021421255201 |
7 | 111241240636 |
oct | 21177436721 |
9 | 5870308721 |
10 | 2315140561 |
11 | a88922408 |
12 | 547404501 |
13 | 2ab846776 |
14 | 17d69018d |
15 | d83b2891 |
hex | 89fe3dd1 |
2315140561 has 2 divisors, whose sum is σ = 2315140562. Its totient is φ = 2315140560.
The previous prime is 2315140549. The next prime is 2315140573. The reversal of 2315140561 is 1650415132.
It is a balanced prime because it is at equal distance from previous prime (2315140549) and next prime (2315140573).
It can be written as a sum of positive squares in only one way, i.e., 2211914961 + 103225600 = 47031^2 + 10160^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2315140561 is a prime.
It is not a weakly prime, because it can be changed into another prime (2315140501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1157570280 + 1157570281.
It is an arithmetic number, because the mean of its divisors is an integer number (1157570281).
Almost surely, 22315140561 is an apocalyptic number.
It is an amenable number.
2315140561 is a deficient number, since it is larger than the sum of its proper divisors (1).
2315140561 is an equidigital number, since it uses as much as digits as its factorization.
2315140561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 2315140561 is about 48115.9075670407. The cubic root of 2315140561 is about 1322.8962578435.
Adding to 2315140561 its reverse (1650415132), we get a palindrome (3965555693).
The spelling of 2315140561 in words is "two billion, three hundred fifteen million, one hundred forty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •