Base | Representation |
---|---|
bin | 100101000011010… |
… | …0001110000011101 |
3 | 10012122100101020201 |
4 | 1022012201300131 |
5 | 10021231200432 |
6 | 323210343501 |
7 | 42544145011 |
oct | 11206416035 |
9 | 3178311221 |
10 | 1243225117 |
11 | 58884a482 |
12 | 2a842ab91 |
13 | 16a749c84 |
14 | bb182541 |
15 | 74227ee7 |
hex | 4a1a1c1d |
1243225117 has 2 divisors, whose sum is σ = 1243225118. Its totient is φ = 1243225116.
The previous prime is 1243225097. The next prime is 1243225121. The reversal of 1243225117 is 7115223421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1182603321 + 60621796 = 34389^2 + 7786^2 .
It is an emirp because it is prime and its reverse (7115223421) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1243225117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1243225127) 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, 621612558 + 621612559.
It is an arithmetic number, because the mean of its divisors is an integer number (621612559).
Almost surely, 21243225117 is an apocalyptic number.
It is an amenable number.
1243225117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1243225117 is an equidigital number, since it uses as much as digits as its factorization.
1243225117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3360, while the sum is 28.
The square root of 1243225117 is about 35259.3975700096. The cubic root of 1243225117 is about 1075.2676793661.
Adding to 1243225117 its reverse (7115223421), we get a palindrome (8358448538).
The spelling of 1243225117 in words is "one billion, two hundred forty-three million, two hundred twenty-five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •