Base | Representation |
---|---|
bin | 100001111100000… |
… | …0001011110000001 |
3 | 2221100202222102202 |
4 | 1003320001132001 |
5 | 4313010301203 |
6 | 304555322545 |
7 | 40135203461 |
oct | 10370013601 |
9 | 2840688382 |
10 | 1138759553 |
11 | 5348889a8 |
12 | 279450455 |
13 | 151c01a29 |
14 | ab34bba1 |
15 | 69e90388 |
hex | 43e01781 |
1138759553 has 2 divisors, whose sum is σ = 1138759554. Its totient is φ = 1138759552.
The previous prime is 1138759541. The next prime is 1138759561. The reversal of 1138759553 is 3559578311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1137577984 + 1181569 = 33728^2 + 1087^2 .
It is a cyclic number.
It is not a de Polignac number, because 1138759553 - 210 = 1138758529 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1138759498 and 1138759507.
It is not a weakly prime, because it can be changed into another prime (1131759553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 569379776 + 569379777.
It is an arithmetic number, because the mean of its divisors is an integer number (569379777).
Almost surely, 21138759553 is an apocalyptic number.
It is an amenable number.
1138759553 is a deficient number, since it is larger than the sum of its proper divisors (1).
1138759553 is an equidigital number, since it uses as much as digits as its factorization.
1138759553 is an evil number, because the sum of its binary digits is even.
The product of its digits is 567000, while the sum is 47.
The square root of 1138759553 is about 33745.5115978407. The cubic root of 1138759553 is about 1044.2648929889.
The spelling of 1138759553 in words is "one billion, one hundred thirty-eight million, seven hundred fifty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •