Base | Representation |
---|---|
bin | 10101000100100000… |
… | …10010011001000100 |
3 | 1002012100201220002022 |
4 | 22202100102121010 |
5 | 141131400110340 |
6 | 5110253502312 |
7 | 550216242632 |
oct | 124220223104 |
9 | 32170656068 |
10 | 11312113220 |
11 | 4885436101 |
12 | 22384a1998 |
13 | 10b37a6b25 |
14 | 794518352 |
15 | 4631923b5 |
hex | 2a2412644 |
11312113220 has 48 divisors (see below), whose sum is σ = 25537800960. Its totient is φ = 4195482624.
The previous prime is 11312113213. The next prime is 11312113223. The reversal of 11312113220 is 2231121311.
It is a super-4 number, since 4×113121132204 (a number of 41 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (11312113223) 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 15 ways as a sum of consecutive naturals, for example, 298829 + ... + 334548.
It is an arithmetic number, because the mean of its divisors is an integer number (532037520).
Almost surely, 211312113220 is an apocalyptic number.
11312113220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11312113220 is an abundant number, since it is smaller than the sum of its proper divisors (14225687740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11312113220 is a wasteful number, since it uses less digits than its factorization.
11312113220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633452 (or 633450 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11312113220 its reverse (2231121311), we get a palindrome (13543234531).
The spelling of 11312113220 in words is "eleven billion, three hundred twelve million, one hundred thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •