Base | Representation |
---|---|
bin | 10100110001100011… |
… | …00100010010101101 |
3 | 1001210021110102010102 |
4 | 22120301210102231 |
5 | 140320141041013 |
6 | 5042412520445 |
7 | 543245326610 |
oct | 123061442255 |
9 | 31707412112 |
10 | 11153065133 |
11 | 4803683a01 |
12 | 21b3180125 |
13 | 108985a732 |
14 | 77b356177 |
15 | 454226d58 |
hex | 298c644ad |
11153065133 has 8 divisors (see below), whose sum is σ = 12750380160. Its totient is φ = 9556755120.
The previous prime is 11153065129. The next prime is 11153065159. The reversal of 11153065133 is 33156035111.
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 11153065133 - 22 = 11153065129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11153065096 and 11153065105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11153065103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 227318 + ... + 271991.
It is an arithmetic number, because the mean of its divisors is an integer number (1593797520).
Almost surely, 211153065133 is an apocalyptic number.
It is an amenable number.
11153065133 is a deficient number, since it is larger than the sum of its proper divisors (1597315027).
11153065133 is an equidigital number, since it uses as much as digits as its factorization.
11153065133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502507.
The product of its (nonzero) digits is 4050, while the sum is 29.
The spelling of 11153065133 in words is "eleven billion, one hundred fifty-three million, sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •