Base | Representation |
---|---|
bin | 10100101110111010… |
… | …11111110000000011 |
3 | 1001201201222201201100 |
4 | 22113131133300003 |
5 | 140244020321220 |
6 | 5040304305443 |
7 | 542560110054 |
oct | 122735376003 |
9 | 31651881640 |
10 | 11131026435 |
11 | 47a21a0a01 |
12 | 21a7912283 |
13 | 1085112399 |
14 | 77845a72b |
15 | 452321d90 |
hex | 29775fc03 |
11131026435 has 24 divisors (see below), whose sum is σ = 19620797040. Its totient is φ = 5835926592.
The previous prime is 11131026407. The next prime is 11131026449. The reversal of 11131026435 is 53462013111.
It is a happy number.
11131026435 is a `hidden beast` number, since 1 + 1 + 1 + 3 + 10 + 2 + 643 + 5 = 666.
It is not a de Polignac number, because 11131026435 - 26 = 11131026371 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11131026399 and 11131026408.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2093584 + ... + 2098893.
It is an arithmetic number, because the mean of its divisors is an integer number (817533210).
Almost surely, 211131026435 is an apocalyptic number.
11131026435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11131026435 is a deficient number, since it is larger than the sum of its proper divisors (8489770605).
11131026435 is a wasteful number, since it uses less digits than its factorization.
11131026435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4192547 (or 4192544 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 11131026435 its reverse (53462013111), we get a palindrome (64593039546).
The spelling of 11131026435 in words is "eleven billion, one hundred thirty-one million, twenty-six thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •