Base | Representation |
---|---|
bin | 100100010111110… |
… | …1110100011101001 |
3 | 10011001112100111021 |
4 | 1020233232203221 |
5 | 4444420033032 |
6 | 321034532441 |
7 | 42146555353 |
oct | 11057564351 |
9 | 3131470437 |
10 | 1220471017 |
11 | 576a18a37 |
12 | 2a0897121 |
13 | 165b110cc |
14 | b813c0d3 |
15 | 72231097 |
hex | 48bee8e9 |
1220471017 has 2 divisors, whose sum is σ = 1220471018. Its totient is φ = 1220471016.
The previous prime is 1220470967. The next prime is 1220471047. The reversal of 1220471017 is 7101740221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1135757401 + 84713616 = 33701^2 + 9204^2 .
It is an emirp because it is prime and its reverse (7101740221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220471017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220470982 and 1220471000.
It is not a weakly prime, because it can be changed into another prime (1220471047) 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, 610235508 + 610235509.
It is an arithmetic number, because the mean of its divisors is an integer number (610235509).
Almost surely, 21220471017 is an apocalyptic number.
It is an amenable number.
1220471017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220471017 is an equidigital number, since it uses as much as digits as its factorization.
1220471017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 784, while the sum is 25.
The square root of 1220471017 is about 34935.2403312186. The cubic root of 1220471017 is about 1068.6672249333.
The spelling of 1220471017 in words is "one billion, two hundred twenty million, four hundred seventy-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •