Base | Representation |
---|---|
bin | 1011100110001111… |
… | …1111110001100001 |
3 | 22000222002000122112 |
4 | 2321203333301201 |
5 | 22333441034332 |
6 | 1232531045105 |
7 | 140101641461 |
oct | 27143776141 |
9 | 8028060575 |
10 | 3113221217 |
11 | 13583721a7 |
12 | 72a740795 |
13 | 3a7ca6b42 |
14 | 217679ba1 |
15 | 1334aadb2 |
hex | b98ffc61 |
3113221217 has 2 divisors, whose sum is σ = 3113221218. Its totient is φ = 3113221216.
The previous prime is 3113221183. The next prime is 3113221229. The reversal of 3113221217 is 7121223113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3111854656 + 1366561 = 55784^2 + 1169^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113221217 - 210 = 3113220193 is a prime.
It is a super-2 number, since 2×31132212172 = 19384292691957922178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3113221192 and 3113221201.
It is not a weakly prime, because it can be changed into another prime (3113226217) 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, 1556610608 + 1556610609.
It is an arithmetic number, because the mean of its divisors is an integer number (1556610609).
Almost surely, 23113221217 is an apocalyptic number.
It is an amenable number.
3113221217 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113221217 is an equidigital number, since it uses as much as digits as its factorization.
3113221217 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 504, while the sum is 23.
The square root of 3113221217 is about 55796.2473379707. The cubic root of 3113221217 is about 1460.1696833184.
The spelling of 3113221217 in words is "three billion, one hundred thirteen million, two hundred twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •