Base | Representation |
---|---|
bin | 10100110010011000… |
… | …10000011011100000 |
3 | 1001210202121212120012 |
4 | 22121030100123200 |
5 | 140323433433124 |
6 | 5043222504052 |
7 | 543361646633 |
oct | 123114203340 |
9 | 31722555505 |
10 | 11160061664 |
11 | 4807622564 |
12 | 21b5595028 |
13 | 108b13a1ab |
14 | 77c257c1a |
15 | 454b59e0e |
hex | 2993106e0 |
11160061664 has 12 divisors (see below), whose sum is σ = 21971371464. Its totient is φ = 5580030816.
The previous prime is 11160061663. The next prime is 11160061669. The reversal of 11160061664 is 46616006111.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 348751927 = 11160061664 / (1 + 1 + 1 + 6 + 0 + 0 + 6 + 1 + 6 + 6 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 11160061664.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11160061663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 174375932 + ... + 174375995.
It is an arithmetic number, because the mean of its divisors is an integer number (1830947622).
Almost surely, 211160061664 is an apocalyptic number.
It is an amenable number.
11160061664 is a deficient number, since it is larger than the sum of its proper divisors (10811309800).
11160061664 is an equidigital number, since it uses as much as digits as its factorization.
11160061664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348751937 (or 348751929 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 32.
Adding to 11160061664 its reverse (46616006111), we get a palindrome (57776067775).
The spelling of 11160061664 in words is "eleven billion, one hundred sixty million, sixty-one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •