Base | Representation |
---|---|
bin | 10101100000111010… |
… | …00110111010111101 |
3 | 1002210222000211112212 |
4 | 22300131012322331 |
5 | 142123342331013 |
6 | 5150044110205 |
7 | 556141253522 |
oct | 126035067275 |
9 | 32728024485 |
10 | 11550355133 |
11 | 4997968849 |
12 | 22a4235365 |
13 | 1120c60685 |
14 | 7b8013149 |
15 | 4790526a8 |
hex | 2b0746ebd |
11550355133 has 4 divisors (see below), whose sum is σ = 11696562240. Its totient is φ = 11404148028.
The previous prime is 11550355127. The next prime is 11550355153. The reversal of 11550355133 is 33155305511.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11550355133 - 214 = 11550338749 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11550355133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11550355153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73103435 + ... + 73103592.
It is an arithmetic number, because the mean of its divisors is an integer number (2924140560).
Almost surely, 211550355133 is an apocalyptic number.
It is an amenable number.
11550355133 is a deficient number, since it is larger than the sum of its proper divisors (146207107).
11550355133 is an equidigital number, since it uses as much as digits as its factorization.
11550355133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146207106.
The product of its (nonzero) digits is 16875, while the sum is 32.
The spelling of 11550355133 in words is "eleven billion, five hundred fifty million, three hundred fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •