Base | Representation |
---|---|
bin | 1010011010100011111111… |
… | …0110101100010011110011 |
3 | 1111112202012112012210222112 |
4 | 2212220333312230103303 |
5 | 3000110034223104021 |
6 | 40204420403555535 |
7 | 2261224464630533 |
oct | 246507766542363 |
9 | 44482175183875 |
10 | 11451454113011 |
11 | 3715597342a50 |
12 | 134b45098bbab |
13 | 650b37b490c3 |
14 | 2b83792254c3 |
15 | 14cd2a42ad5b |
hex | a6a3fdac4f3 |
11451454113011 has 32 divisors (see below), whose sum is σ = 13145781282816. Its totient is φ = 9880024896000.
The previous prime is 11451454112941. The next prime is 11451454113023. The reversal of 11451454113011 is 11031145415411.
It is a cyclic number.
It is not a de Polignac number, because 11451454113011 - 218 = 11451453850867 is a prime.
It is a super-2 number, since 2×114514541130112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11451454118011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6193136 + ... + 7826738.
It is an arithmetic number, because the mean of its divisors is an integer number (410805665088).
Almost surely, 211451454113011 is an apocalyptic number.
11451454113011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11451454113011 is a deficient number, since it is larger than the sum of its proper divisors (1694327169805).
11451454113011 is a wasteful number, since it uses less digits than its factorization.
11451454113011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1634043.
The product of its (nonzero) digits is 4800, while the sum is 32.
Adding to 11451454113011 its reverse (11031145415411), we get a palindrome (22482599528422).
The spelling of 11451454113011 in words is "eleven trillion, four hundred fifty-one billion, four hundred fifty-four million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •