Base | Representation |
---|---|
bin | 100100100001000… |
… | …1011111101000001 |
3 | 10011101122012100111 |
4 | 1021002023331001 |
5 | 10002134410032 |
6 | 321330351321 |
7 | 42235651261 |
oct | 11102137501 |
9 | 3141565314 |
10 | 1225310017 |
11 | 579723608 |
12 | 2a242b541 |
13 | 166b16819 |
14 | b8a3b7a1 |
15 | 72889c47 |
hex | 4908bf41 |
1225310017 has 2 divisors, whose sum is σ = 1225310018. Its totient is φ = 1225310016.
The previous prime is 1225309997. The next prime is 1225310029. The reversal of 1225310017 is 7100135221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1158789681 + 66520336 = 34041^2 + 8156^2 .
It is a cyclic number.
It is not a de Polignac number, because 1225310017 - 211 = 1225307969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1225310017.
It is not a weakly prime, because it can be changed into another prime (1225310077) 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, 612655008 + 612655009.
It is an arithmetic number, because the mean of its divisors is an integer number (612655009).
Almost surely, 21225310017 is an apocalyptic number.
It is an amenable number.
1225310017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225310017 is an equidigital number, since it uses as much as digits as its factorization.
1225310017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 22.
The square root of 1225310017 is about 35004.4285341155. The cubic root of 1225310017 is about 1070.0777353487.
Adding to 1225310017 its reverse (7100135221), we get a palindrome (8325445238).
The spelling of 1225310017 in words is "one billion, two hundred twenty-five million, three hundred ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •