Base | Representation |
---|---|
bin | 1010011111011000000111… |
… | …1000110010111110000000 |
3 | 1111211122200212212021012210 |
4 | 2213312001320302332000 |
5 | 3002433433040330311 |
6 | 40310420050022120 |
7 | 2300213252150055 |
oct | 247660170627600 |
9 | 44748625767183 |
10 | 11534166339456 |
11 | 3747681226992 |
12 | 1363494b77940 |
13 | 658889b58727 |
14 | 2bc38429702c |
15 | 15006ba973a6 |
hex | a7d81e32f80 |
11534166339456 has 64 divisors (see below), whose sum is σ = 30725922574080. Its totient is φ = 3833642178048.
The previous prime is 11534166339433. The next prime is 11534166339503. The reversal of 11534166339456 is 65493366143511.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 11534166339396 and 11534166339405.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43147576 + ... + 43414071.
It is an arithmetic number, because the mean of its divisors is an integer number (480092540220).
Almost surely, 211534166339456 is an apocalyptic number.
11534166339456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11534166339456 is an abundant number, since it is smaller than the sum of its proper divisors (19191756234624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11534166339456 is an equidigital number, since it uses as much as digits as its factorization.
11534166339456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86562011 (or 86561999 counting only the distinct ones).
The product of its digits is 20995200, while the sum is 57.
The spelling of 11534166339456 in words is "eleven trillion, five hundred thirty-four billion, one hundred sixty-six million, three hundred thirty-nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •