Base | Representation |
---|---|
bin | 100010011001000… |
… | …1010010010100001 |
3 | 2222102110021102222 |
4 | 1010302022102201 |
5 | 4330411000113 |
6 | 310302120425 |
7 | 40411560404 |
oct | 10462122241 |
9 | 2872407388 |
10 | 1154000033 |
11 | 54244833a |
12 | 282580115 |
13 | 155109974 |
14 | ad397d3b |
15 | 6b4a0e08 |
hex | 44c8a4a1 |
1154000033 has 8 divisors (see below), whose sum is σ = 1157587200. Its totient is φ = 1150419808.
The previous prime is 1154000011. The next prime is 1154000041. The reversal of 1154000033 is 3300004511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1154000033 - 26 = 1153999969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1153999975 and 1154000020.
It is not an unprimeable number, because it can be changed into a prime (1154000053) 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 in 7 ways as a sum of consecutive naturals, for example, 602285 + ... + 604197.
It is an arithmetic number, because the mean of its divisors is an integer number (144698400).
Almost surely, 21154000033 is an apocalyptic number.
It is an amenable number.
1154000033 is a deficient number, since it is larger than the sum of its proper divisors (3587167).
1154000033 is an equidigital number, since it uses as much as digits as its factorization.
1154000033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3471.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 1154000033 is about 33970.5759886405. The cubic root of 1154000033 is about 1048.9028700481.
Adding to 1154000033 its reverse (3300004511), we get a palindrome (4454004544).
The spelling of 1154000033 in words is "one billion, one hundred fifty-four million, thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •