Base | Representation |
---|---|
bin | 1010000111100111100100… |
… | …0100010010110011100101 |
3 | 1110101122010211020021220021 |
4 | 2201321321010102303211 |
5 | 2424242020043343011 |
6 | 35355113501035141 |
7 | 2225553364363150 |
oct | 241717104226345 |
9 | 43348124207807 |
10 | 11125996465381 |
11 | 35aa565a50246 |
12 | 12b8361855ab1 |
13 | 62923ba3a395 |
14 | 2a670304ac97 |
15 | 14462ccea471 |
hex | a1e79112ce5 |
11125996465381 has 16 divisors (see below), whose sum is σ = 12798322702848. Its totient is φ = 9474475795200.
The previous prime is 11125996465369. The next prime is 11125996465393. The reversal of 11125996465381 is 18356469952111.
It is an interprime number because it is at equal distance from previous prime (11125996465369) and next prime (11125996465393).
It is a cyclic number.
It is not a de Polignac number, because 11125996465381 - 217 = 11125996334309 is a prime.
It is a super-2 number, since 2×111259964653812 (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 (11125996469381) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1727085 + ... + 5023426.
It is an arithmetic number, because the mean of its divisors is an integer number (799895168928).
Almost surely, 211125996465381 is an apocalyptic number.
It is an amenable number.
11125996465381 is a deficient number, since it is larger than the sum of its proper divisors (1672326237467).
11125996465381 is a wasteful number, since it uses less digits than its factorization.
11125996465381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6752052.
The product of its digits is 13996800, while the sum is 61.
The spelling of 11125996465381 in words is "eleven trillion, one hundred twenty-five billion, nine hundred ninety-six million, four hundred sixty-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •