Base | Representation |
---|---|
bin | 100100011010110… |
… | …0111000110000001 |
3 | 10011011102201010100 |
4 | 1020311213012001 |
5 | 10000313411223 |
6 | 321131553013 |
7 | 42165641013 |
oct | 11065470601 |
9 | 3134381110 |
10 | 1222013313 |
11 | 577881764 |
12 | 2a12bb769 |
13 | 166231101 |
14 | b84201b3 |
15 | 72438043 |
hex | 48d67181 |
1222013313 has 12 divisors (see below), whose sum is σ = 1765853908. Its totient is φ = 814341600.
The previous prime is 1222013293. The next prime is 1222013333. The reversal of 1222013313 is 3133102221.
It is an interprime number because it is at equal distance from previous prime (1222013293) and next prime (1222013333).
It can be written as a sum of positive squares in 2 ways, for example, as 803892609 + 418120704 = 28353^2 + 20448^2 .
It is not a de Polignac number, because 1222013313 - 26 = 1222013249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1222013333) 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 in 11 ways as a sum of consecutive naturals, for example, 3538 + ... + 49563.
Almost surely, 21222013313 is an apocalyptic number.
It is an amenable number.
1222013313 is a deficient number, since it is larger than the sum of its proper divisors (543840595).
1222013313 is a wasteful number, since it uses less digits than its factorization.
1222013313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55664 (or 55661 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1222013313 is about 34957.3070044018. The cubic root of 1222013313 is about 1069.1171898455.
Adding to 1222013313 its reverse (3133102221), we get a palindrome (4355115534).
The spelling of 1222013313 in words is "one billion, two hundred twenty-two million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •