Base | Representation |
---|---|
bin | 1000011001011001… |
… | …1000101000100101 |
3 | 12211002022211022112 |
4 | 2012112120220211 |
5 | 14104011440023 |
6 | 1011355210405 |
7 | 106566545225 |
oct | 20626305045 |
9 | 5732284275 |
10 | 2254015013 |
11 | a57372928 |
12 | 52aa46a05 |
13 | 29bc943c3 |
14 | 1754dc085 |
15 | d2d3b478 |
hex | 86598a25 |
2254015013 has 2 divisors, whose sum is σ = 2254015014. Its totient is φ = 2254015012.
The previous prime is 2254015007. The next prime is 2254015039. The reversal of 2254015013 is 3105104522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2119037089 + 134977924 = 46033^2 + 11618^2 .
It is a cyclic number.
It is not a de Polignac number, because 2254015013 - 28 = 2254014757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2254015013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2254015073) 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, 1127007506 + 1127007507.
It is an arithmetic number, because the mean of its divisors is an integer number (1127007507).
Almost surely, 22254015013 is an apocalyptic number.
It is an amenable number.
2254015013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2254015013 is an equidigital number, since it uses as much as digits as its factorization.
2254015013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 2254015013 is about 47476.4679920484. The cubic root of 2254015013 is about 1311.1496643725.
Adding to 2254015013 its reverse (3105104522), we get a palindrome (5359119535).
The spelling of 2254015013 in words is "two billion, two hundred fifty-four million, fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •