Base | Representation |
---|---|
bin | 100001100010011… |
… | …0111111111110101 |
3 | 2220102112202220222 |
4 | 1003010313333311 |
5 | 4301042221123 |
6 | 303400104125 |
7 | 36613220624 |
oct | 10304677765 |
9 | 2812482828 |
10 | 1125351413 |
11 | 52826019a |
12 | 274a65045 |
13 | 14c1b8b14 |
14 | a965b6bb |
15 | 68be26c8 |
hex | 43137ff5 |
1125351413 has 2 divisors, whose sum is σ = 1125351414. Its totient is φ = 1125351412.
The previous prime is 1125351401. The next prime is 1125351419. The reversal of 1125351413 is 3141535211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1119772369 + 5579044 = 33463^2 + 2362^2 .
It is an emirp because it is prime and its reverse (3141535211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1125351413 - 222 = 1121157109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1125351419) 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, 562675706 + 562675707.
It is an arithmetic number, because the mean of its divisors is an integer number (562675707).
Almost surely, 21125351413 is an apocalyptic number.
It is an amenable number.
1125351413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1125351413 is an equidigital number, since it uses as much as digits as its factorization.
1125351413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1800, while the sum is 26.
The square root of 1125351413 is about 33546.2578091804. The cubic root of 1125351413 is about 1040.1501918814.
Adding to 1125351413 its reverse (3141535211), we get a palindrome (4266886624).
The spelling of 1125351413 in words is "one billion, one hundred twenty-five million, three hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •