Base | Representation |
---|---|
bin | 100010001110101… |
… | …0011010110101001 |
3 | 2222001011110220022 |
4 | 1010131103112221 |
5 | 4323011012022 |
6 | 305545010225 |
7 | 40314235124 |
oct | 10435232651 |
9 | 2861143808 |
10 | 1148532137 |
11 | 53a353215 |
12 | 280783975 |
13 | 153c43c1c |
14 | ac7733bb |
15 | 6ac70c42 |
hex | 447535a9 |
1148532137 has 2 divisors, whose sum is σ = 1148532138. Its totient is φ = 1148532136.
The previous prime is 1148532079. The next prime is 1148532149. The reversal of 1148532137 is 7312358411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1042256656 + 106275481 = 32284^2 + 10309^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1148532137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1148532097 and 1148532106.
It is not a weakly prime, because it can be changed into another prime (1148534137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 574266068 + 574266069.
It is an arithmetic number, because the mean of its divisors is an integer number (574266069).
Almost surely, 21148532137 is an apocalyptic number.
It is an amenable number.
1148532137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1148532137 is an equidigital number, since it uses as much as digits as its factorization.
1148532137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20160, while the sum is 35.
The square root of 1148532137 is about 33890.0005458837. Note that the first 3 decimals coincide. The cubic root of 1148532137 is about 1047.2436054886.
The spelling of 1148532137 in words is "one billion, one hundred forty-eight million, five hundred thirty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •