Base | Representation |
---|---|
bin | 10101001101110110… |
… | …10010011101100110 |
3 | 1002101211020002002010 |
4 | 22212323102131212 |
5 | 141311431311231 |
6 | 5122133455050 |
7 | 552160414653 |
oct | 124673223546 |
9 | 32354202063 |
10 | 11390494566 |
11 | 4915701180 |
12 | 225a7a1486 |
13 | 10c6abb519 |
14 | 7a0abcc2a |
15 | 469ec6546 |
hex | 2a6ed2766 |
11390494566 has 64 divisors (see below), whose sum is σ = 26177690880. Its totient is φ = 3267786240.
The previous prime is 11390494541. The next prime is 11390494567. The reversal of 11390494566 is 66549409311.
It is a happy number.
It is a super-3 number, since 3×113904945663 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11390494567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3099306 + ... + 3102978.
It is an arithmetic number, because the mean of its divisors is an integer number (409026420).
Almost surely, 211390494566 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11390494566, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13088845440).
11390494566 is an abundant number, since it is smaller than the sum of its proper divisors (14787196314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11390494566 is a wasteful number, since it uses less digits than its factorization.
11390494566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6181.
The product of its (nonzero) digits is 699840, while the sum is 48.
The spelling of 11390494566 in words is "eleven billion, three hundred ninety million, four hundred ninety-four thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •