Base | Representation |
---|---|
bin | 1010000001000000000100… |
… | …0001110110111001001111 |
3 | 1102222202201001111202221021 |
4 | 2200100001001312321033 |
5 | 2420411204213124101 |
6 | 35230553102415011 |
7 | 2214420251354233 |
oct | 240200101667117 |
9 | 42882631452837 |
10 | 11012313411151 |
11 | 3566328914a68 |
12 | 129a315591467 |
13 | 61b5c24a0a60 |
14 | 2a0ddaa585c3 |
15 | 1416c76d75a1 |
hex | a0401076e4f |
11012313411151 has 16 divisors (see below), whose sum is σ = 12057216040800. Its totient is φ = 9997019107200.
The previous prime is 11012313411133. The next prime is 11012313411173. The reversal of 11012313411151 is 15111431321011.
It is not a de Polignac number, because 11012313411151 - 27 = 11012313411023 is a prime.
It is a super-2 number, since 2×110123134111512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012313411131) 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 15 ways as a sum of consecutive naturals, for example, 27949125 + ... + 28340398.
It is an arithmetic number, because the mean of its divisors is an integer number (753576002550).
Almost surely, 211012313411151 is an apocalyptic number.
11012313411151 is a deficient number, since it is larger than the sum of its proper divisors (1044902629649).
11012313411151 is a wasteful number, since it uses less digits than its factorization.
11012313411151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56289786.
The product of its (nonzero) digits is 360, while the sum is 25.
Adding to 11012313411151 its reverse (15111431321011), we get a palindrome (26123744732162).
The spelling of 11012313411151 in words is "eleven trillion, twelve billion, three hundred thirteen million, four hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •