Base | Representation |
---|---|
bin | 100010001110011… |
… | …1111010101011001 |
3 | 2222001000022102021 |
4 | 1010130333111121 |
5 | 4323000401022 |
6 | 305543134441 |
7 | 40313444062 |
oct | 10434772531 |
9 | 2861008367 |
10 | 1148450137 |
11 | 53a2a764a |
12 | 280744421 |
13 | 153c157c3 |
14 | ac751569 |
15 | 6ac567c7 |
hex | 4473f559 |
1148450137 has 2 divisors, whose sum is σ = 1148450138. Its totient is φ = 1148450136.
The previous prime is 1148450129. The next prime is 1148450159. The reversal of 1148450137 is 7310548411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1147583376 + 866761 = 33876^2 + 931^2 .
It is an emirp because it is prime and its reverse (7310548411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1148450137 - 23 = 1148450129 is a prime.
It is not a weakly prime, because it can be changed into another prime (1148450197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 574225068 + 574225069.
It is an arithmetic number, because the mean of its divisors is an integer number (574225069).
Almost surely, 21148450137 is an apocalyptic number.
It is an amenable number.
1148450137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1148450137 is an equidigital number, since it uses as much as digits as its factorization.
1148450137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 34.
The square root of 1148450137 is about 33888.7907279088. The cubic root of 1148450137 is about 1047.2186820765.
Adding to 1148450137 its reverse (7310548411), we get a palindrome (8458998548).
The spelling of 1148450137 in words is "one billion, one hundred forty-eight million, four hundred fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •