Base | Representation |
---|---|
bin | 100000110101000… |
… | …0101001001001001 |
3 | 2211202202112201211 |
4 | 1001222011021021 |
5 | 4223444101103 |
6 | 301150013121 |
7 | 36204010324 |
oct | 10152051111 |
9 | 2752675654 |
10 | 1101550153 |
11 | 515883a30 |
12 | 268aa71a1 |
13 | 1472a4432 |
14 | a64237bb |
15 | 66a9036d |
hex | 41a85249 |
1101550153 has 8 divisors (see below), whose sum is σ = 1204144416. Its totient is φ = 999364800.
The previous prime is 1101550147. The next prime is 1101550159. The reversal of 1101550153 is 3510551011.
It is an interprime number because it is at equal distance from previous prime (1101550147) and next prime (1101550159).
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 1101550153 - 29 = 1101549641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101550159) 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, 96576 + ... + 107377.
It is an arithmetic number, because the mean of its divisors is an integer number (150518052).
Almost surely, 21101550153 is an apocalyptic number.
It is an amenable number.
1101550153 is a deficient number, since it is larger than the sum of its proper divisors (102594263).
1101550153 is a wasteful number, since it uses less digits than its factorization.
1101550153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204455.
The product of its (nonzero) digits is 375, while the sum is 22.
The square root of 1101550153 is about 33189.6091118892. The cubic root of 1101550153 is about 1032.7647945552.
The spelling of 1101550153 in words is "one billion, one hundred one million, five hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •