Base | Representation |
---|---|
bin | 1000010011000010… |
… | …0011101010101001 |
3 | 12202020002122201101 |
4 | 2010300203222221 |
5 | 14030143242023 |
6 | 1005003121401 |
7 | 106123630504 |
oct | 20460435251 |
9 | 5666078641 |
10 | 2227321513 |
11 | a432a068a |
12 | 521b13261 |
13 | 2965a9431 |
14 | 171b5013b |
15 | d08171ad |
hex | 84c23aa9 |
2227321513 has 2 divisors, whose sum is σ = 2227321514. Its totient is φ = 2227321512.
The previous prime is 2227321483. The next prime is 2227321529. The reversal of 2227321513 is 3151237222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1714208409 + 513113104 = 41403^2 + 22652^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2227321513 is a prime.
It is a super-2 number, since 2×22273215132 = 9921922244545218338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2227328513) 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, 1113660756 + 1113660757.
It is an arithmetic number, because the mean of its divisors is an integer number (1113660757).
Almost surely, 22227321513 is an apocalyptic number.
It is an amenable number.
2227321513 is a deficient number, since it is larger than the sum of its proper divisors (1).
2227321513 is an equidigital number, since it uses as much as digits as its factorization.
2227321513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5040, while the sum is 28.
The square root of 2227321513 is about 47194.5072333635. The cubic root of 2227321513 is about 1305.9532703040.
Adding to 2227321513 its reverse (3151237222), we get a palindrome (5378558735).
The spelling of 2227321513 in words is "two billion, two hundred twenty-seven million, three hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •