Base | Representation |
---|---|
bin | 10101001100110000… |
… | …00110100010000000 |
3 | 1002101011212110020211 |
4 | 22212120012202000 |
5 | 141302101130111 |
6 | 5121204043504 |
7 | 552016130050 |
oct | 124630064200 |
9 | 32334773224 |
10 | 11381270656 |
11 | 4910481108 |
12 | 2257693594 |
13 | 10c4c0bca2 |
14 | 79d79b560 |
15 | 4692a3521 |
hex | 2a6606880 |
11381270656 has 32 divisors (see below), whose sum is σ = 25912716480. Its totient is φ = 4877687040.
The previous prime is 11381270629. The next prime is 11381270657. The reversal of 11381270656 is 65607218311.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (32).
It is not an unprimeable number, because it can be changed into a prime (11381270657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6350260 + ... + 6352051.
It is an arithmetic number, because the mean of its divisors is an integer number (809772390).
Almost surely, 211381270656 is an apocalyptic number.
11381270656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11381270656 is an abundant number, since it is smaller than the sum of its proper divisors (14531445824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11381270656 is an equidigital number, since it uses as much as digits as its factorization.
11381270656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12702332 (or 12702320 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
Adding to 11381270656 its reverse (65607218311), we get a palindrome (76988488967).
The spelling of 11381270656 in words is "eleven billion, three hundred eighty-one million, two hundred seventy thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •