Base | Representation |
---|---|
bin | 1101001000011… |
… | …00100101100001 |
3 | 21200021022011221 |
4 | 12210030211201 |
5 | 211144331113 |
6 | 14532535041 |
7 | 2505163645 |
oct | 644144541 |
9 | 250238157 |
10 | 110152033 |
11 | 571a5942 |
12 | 30a81481 |
13 | 19a89624 |
14 | 108b4c25 |
15 | 9a0c98d |
hex | 690c961 |
110152033 has 2 divisors, whose sum is σ = 110152034. Its totient is φ = 110152032.
The previous prime is 110152001. The next prime is 110152043. The reversal of 110152033 is 330251011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99341089 + 10810944 = 9967^2 + 3288^2 .
It is a cyclic number.
It is not a de Polignac number, because 110152033 - 25 = 110152001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110151998 and 110152016.
It is not a weakly prime, because it can be changed into another prime (110152043) 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, 55076016 + 55076017.
It is an arithmetic number, because the mean of its divisors is an integer number (55076017).
Almost surely, 2110152033 is an apocalyptic number.
It is an amenable number.
110152033 is a deficient number, since it is larger than the sum of its proper divisors (1).
110152033 is an equidigital number, since it uses as much as digits as its factorization.
110152033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 110152033 is about 10495.3338679625. Note that the first 3 decimals coincide. The cubic root of 110152033 is about 479.3626277031.
The spelling of 110152033 in words is "one hundred ten million, one hundred fifty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.806 sec. • engine limits •