Base | Representation |
---|---|
bin | 100100010111100… |
… | …0111100111011001 |
3 | 10011001020020200201 |
4 | 1020233013213121 |
5 | 4444344432023 |
6 | 321031302201 |
7 | 42145322341 |
oct | 11057074731 |
9 | 3131206621 |
10 | 1220311513 |
11 | 57691a113 |
12 | 2a081a961 |
13 | 165a86625 |
14 | b80d9d21 |
15 | 721edbad |
hex | 48bc79d9 |
1220311513 has 2 divisors, whose sum is σ = 1220311514. Its totient is φ = 1220311512.
The previous prime is 1220311501. The next prime is 1220311517. The reversal of 1220311513 is 3151130221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1112089104 + 108222409 = 33348^2 + 10403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220311513 is a prime.
It is not a weakly prime, because it can be changed into another prime (1220311517) 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, 610155756 + 610155757.
It is an arithmetic number, because the mean of its divisors is an integer number (610155757).
Almost surely, 21220311513 is an apocalyptic number.
It is an amenable number.
1220311513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220311513 is an equidigital number, since it uses as much as digits as its factorization.
1220311513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1220311513 is about 34932.9574041477. The cubic root of 1220311513 is about 1068.6206680109.
Adding to 1220311513 its reverse (3151130221), we get a palindrome (4371441734).
It can be divided in two parts, 12203 and 11513, that added together give a square (23716 = 1542).
The spelling of 1220311513 in words is "one billion, two hundred twenty million, three hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •