Base | Representation |
---|---|
bin | 1010000111000100101000… |
… | …0000011110111001000001 |
3 | 1110100201221011010012202102 |
4 | 2201301022000132321001 |
5 | 2424113312423040221 |
6 | 35350523042400145 |
7 | 2225102063304410 |
oct | 241611200367101 |
9 | 43321834105672 |
10 | 11116617002561 |
11 | 35a6592540a84 |
12 | 12b6584660055 |
13 | 6283a5789595 |
14 | 2a6093499477 |
15 | 14427e66530b |
hex | a1c4a01ee41 |
11116617002561 has 8 divisors (see below), whose sum is σ = 12804742195200. Its totient is φ = 9453501072288.
The previous prime is 11116617002507. The next prime is 11116617002597. The reversal of 11116617002561 is 16520071661111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11116617002561 - 26 = 11116617002497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11116617002861) 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 7 ways as a sum of consecutive naturals, for example, 6252314636 + ... + 6252316413.
It is an arithmetic number, because the mean of its divisors is an integer number (1600592774400).
Almost surely, 211116617002561 is an apocalyptic number.
It is an amenable number.
11116617002561 is a deficient number, since it is larger than the sum of its proper divisors (1688125192639).
11116617002561 is a wasteful number, since it uses less digits than its factorization.
11116617002561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12504631183.
The product of its (nonzero) digits is 15120, while the sum is 38.
Adding to 11116617002561 its reverse (16520071661111), we get a palindrome (27636688663672).
The spelling of 11116617002561 in words is "eleven trillion, one hundred sixteen billion, six hundred seventeen million, two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •