Base | Representation |
---|---|
bin | 1010100100001001100101… |
… | …0011001011111011110011 |
3 | 1112010111100102000012222010 |
4 | 2221002121103023323303 |
5 | 3010304400324341201 |
6 | 40412220350014003 |
7 | 2306145234466230 |
oct | 251023123137363 |
9 | 45114312005863 |
10 | 11616163512051 |
11 | 377942951932a |
12 | 13773597a7303 |
13 | 663526987977 |
14 | 2c2322392787 |
15 | 15226a56abd6 |
hex | a90994cbef3 |
11616163512051 has 16 divisors (see below), whose sum is σ = 18742045330944. Its totient is φ = 6247348443264.
The previous prime is 11616163512049. The next prime is 11616163512053. The reversal of 11616163512051 is 15021536161611.
It is an interprime number because it is at equal distance from previous prime (11616163512049) and next prime (11616163512053).
It is not a de Polignac number, because 11616163512051 - 21 = 11616163512049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11616163512053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16269136215 + ... + 16269136928.
It is an arithmetic number, because the mean of its divisors is an integer number (1171377833184).
Almost surely, 211616163512051 is an apocalyptic number.
11616163512051 is a deficient number, since it is larger than the sum of its proper divisors (7125881818893).
11616163512051 is a wasteful number, since it uses less digits than its factorization.
11616163512051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32538273170.
The product of its (nonzero) digits is 32400, while the sum is 39.
Adding to 11616163512051 its reverse (15021536161611), we get a palindrome (26637699673662).
The spelling of 11616163512051 in words is "eleven trillion, six hundred sixteen billion, one hundred sixty-three million, five hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •