Base | Representation |
---|---|
bin | 10100111101101101… |
… | …00011001010010001 |
3 | 1002001101022222211010 |
4 | 22132312203022101 |
5 | 141022242101023 |
6 | 5100454241133 |
7 | 545624133462 |
oct | 123666431221 |
9 | 32041288733 |
10 | 11255034513 |
11 | 48561a0018 |
12 | 22213561a9 |
13 | 10a4a10748 |
14 | 78aadad69 |
15 | 45d16a093 |
hex | 29eda3291 |
11255034513 has 32 divisors (see below), whose sum is σ = 15286579200. Its totient is φ = 7365206016.
The previous prime is 11255034509. The next prime is 11255034577. The reversal of 11255034513 is 31543055211.
11255034513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11255034513 - 22 = 11255034509 is a prime.
It is a super-2 number, since 2×112550345132 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11255033513) 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 31 ways as a sum of consecutive naturals, for example, 19780093 + ... + 19780661.
It is an arithmetic number, because the mean of its divisors is an integer number (477705600).
Almost surely, 211255034513 is an apocalyptic number.
It is an amenable number.
11255034513 is a deficient number, since it is larger than the sum of its proper divisors (4031544687).
11255034513 is a wasteful number, since it uses less digits than its factorization.
11255034513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1161.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 11255034513 its reverse (31543055211), we get a palindrome (42798089724).
The spelling of 11255034513 in words is "eleven billion, two hundred fifty-five million, thirty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •