Base | Representation |
---|---|
bin | 100001111100010… |
… | …0100001010000001 |
3 | 2221101001012022222 |
4 | 1003320210022001 |
5 | 4313024323013 |
6 | 305002340425 |
7 | 40136334632 |
oct | 10370441201 |
9 | 2841035288 |
10 | 1138901633 |
11 | 534975721 |
12 | 2794ba715 |
13 | 151c515bc |
14 | ab387889 |
15 | 69ebc508 |
hex | 43e24281 |
1138901633 has 2 divisors, whose sum is σ = 1138901634. Its totient is φ = 1138901632.
The previous prime is 1138901597. The next prime is 1138901639. The reversal of 1138901633 is 3361098311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 977687824 + 161213809 = 31268^2 + 12697^2 .
It is a cyclic number.
It is not a de Polignac number, because 1138901633 - 28 = 1138901377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1138901593 and 1138901602.
It is not a weakly prime, because it can be changed into another prime (1138901639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 569450816 + 569450817.
It is an arithmetic number, because the mean of its divisors is an integer number (569450817).
Almost surely, 21138901633 is an apocalyptic number.
It is an amenable number.
1138901633 is a deficient number, since it is larger than the sum of its proper divisors (1).
1138901633 is an equidigital number, since it uses as much as digits as its factorization.
1138901633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 1138901633 is about 33747.6167010353. The cubic root of 1138901633 is about 1044.3083212337.
Adding to 1138901633 its reverse (3361098311), we get a palindrome (4499999944).
The spelling of 1138901633 in words is "one billion, one hundred thirty-eight million, nine hundred one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •