Base | Representation |
---|---|
bin | 1010011110001101100100… |
… | …0000100000011011110101 |
3 | 1111202202001010111111110120 |
4 | 2213203121000200123311 |
5 | 3002121441201021010 |
6 | 40253310125442153 |
7 | 2265604306605453 |
oct | 247433100403365 |
9 | 44682033444416 |
10 | 11514153142005 |
11 | 373a141303488 |
12 | 135b62a710359 |
13 | 656a1a80ca67 |
14 | 2bb4063379d3 |
15 | 14e799ac0e70 |
hex | a78d90206f5 |
11514153142005 has 16 divisors (see below), whose sum is σ = 18424365258624. Its totient is φ = 6140308265280.
The previous prime is 11514153142001. The next prime is 11514153142021. The reversal of 11514153142005 is 50024135141511.
It is not a de Polignac number, because 11514153142005 - 22 = 11514153142001 is a prime.
It is a super-2 number, since 2×115141531420052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11514153142001) 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, 35672134 + ... + 35993463.
It is an arithmetic number, because the mean of its divisors is an integer number (1151522828664).
Almost surely, 211514153142005 is an apocalyptic number.
11514153142005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11514153142005 is a deficient number, since it is larger than the sum of its proper divisors (6910212116619).
11514153142005 is a wasteful number, since it uses less digits than its factorization.
11514153142005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71676316.
The product of its (nonzero) digits is 12000, while the sum is 33.
Adding to 11514153142005 its reverse (50024135141511), we get a palindrome (61538288283516).
The spelling of 11514153142005 in words is "eleven trillion, five hundred fourteen billion, one hundred fifty-three million, one hundred forty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •