Base | Representation |
---|---|
bin | 10100111101110000… |
… | …11001101100100001 |
3 | 1002001102020122211100 |
4 | 22132320121230201 |
5 | 141022403120113 |
6 | 5100512505013 |
7 | 545631225132 |
oct | 123670315441 |
9 | 32042218740 |
10 | 11255520033 |
11 | 48564a187a |
12 | 222154b169 |
13 | 10a4b50734 |
14 | 78abc5c89 |
15 | 45d213d73 |
hex | 29ee19b21 |
11255520033 has 12 divisors (see below), whose sum is σ = 16425582628. Its totient is φ = 7426321920.
The previous prime is 11255520019. The next prime is 11255520037. The reversal of 11255520033 is 33002555211.
It is a happy number.
11255520033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 5044976784 + 6210543249 = 71028^2 + 78807^2 .
It is not a de Polignac number, because 11255520033 - 26 = 11255519969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11255519979 and 11255520006.
It is not an unprimeable number, because it can be changed into a prime (11255520037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6445588 + ... + 6447333.
Almost surely, 211255520033 is an apocalyptic number.
It is an amenable number.
11255520033 is a deficient number, since it is larger than the sum of its proper divisors (5170062595).
11255520033 is a wasteful number, since it uses less digits than its factorization.
11255520033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12893024 (or 12893021 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 11255520033 in words is "eleven billion, two hundred fifty-five million, five hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •