Base | Representation |
---|---|
bin | 10101100110111101… |
… | …11011001101011100 |
3 | 1002221111122010222102 |
4 | 22303132323031130 |
5 | 142224344204400 |
6 | 5155101104232 |
7 | 560326154642 |
oct | 126336731534 |
9 | 32844563872 |
10 | 11601163100 |
11 | 4a136105aa |
12 | 22b9258078 |
13 | 112b63c767 |
14 | 7c0a7b192 |
15 | 47d73b9d5 |
hex | 2b37bb35c |
11601163100 has 36 divisors (see below), whose sum is σ = 25216542288. Its totient is φ = 4632720000.
The previous prime is 11601163087. The next prime is 11601163109. The reversal of 11601163100 is 136110611.
It is a happy number.
It is a super-2 number, since 2×116011631002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11601163109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36416 + ... + 156615.
It is an arithmetic number, because the mean of its divisors is an integer number (700459508).
Almost surely, 211601163100 is an apocalyptic number.
11601163100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11601163100 is an abundant number, since it is smaller than the sum of its proper divisors (13615379188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11601163100 is a wasteful number, since it uses less digits than its factorization.
11601163100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193646 (or 193639 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11601163100 its reverse (136110611), we get a palindrome (11737273711).
The spelling of 11601163100 in words is "eleven billion, six hundred one million, one hundred sixty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •