Base | Representation |
---|---|
bin | 100001100010000… |
… | …0000110111011101 |
3 | 2220102010022011102 |
4 | 1003010000313131 |
5 | 4301013004342 |
6 | 303351202445 |
7 | 36611260361 |
oct | 10304006735 |
9 | 2812108142 |
10 | 1125125597 |
11 | 528116572 |
12 | 274976425 |
13 | 14c13a0bb |
14 | a95dd2a1 |
15 | 68b9a832 |
hex | 43100ddd |
1125125597 has 2 divisors, whose sum is σ = 1125125598. Its totient is φ = 1125125596.
The previous prime is 1125125581. The next prime is 1125125627. The reversal of 1125125597 is 7955215211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 603734041 + 521391556 = 24571^2 + 22834^2 .
It is an emirp because it is prime and its reverse (7955215211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1125125597 - 24 = 1125125581 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1125125597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1125125497) 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, 562562798 + 562562799.
It is an arithmetic number, because the mean of its divisors is an integer number (562562799).
Almost surely, 21125125597 is an apocalyptic number.
It is an amenable number.
1125125597 is a deficient number, since it is larger than the sum of its proper divisors (1).
1125125597 is an equidigital number, since it uses as much as digits as its factorization.
1125125597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31500, while the sum is 38.
The square root of 1125125597 is about 33542.8918997751. The cubic root of 1125125597 is about 1040.0806141284.
The spelling of 1125125597 in words is "one billion, one hundred twenty-five million, one hundred twenty-five thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •