Base | Representation |
---|---|
bin | 10100101011011110… |
… | …01111010000001100 |
3 | 1001122201121021200111 |
4 | 22111233033100030 |
5 | 140214120414040 |
6 | 5033353005404 |
7 | 542056326412 |
oct | 122557172014 |
9 | 31581537614 |
10 | 11102123020 |
11 | 478794a38a |
12 | 219a0b3864 |
13 | 107c132581 |
14 | 7746952b2 |
15 | 44ea12dea |
hex | 295bcf40c |
11102123020 has 24 divisors (see below), whose sum is σ = 24685897824. Its totient is φ = 4179622656.
The previous prime is 11102123017. The next prime is 11102123027. The reversal of 11102123020 is 2032120111.
11102123020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11102123027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16326312 + ... + 16326991.
It is an arithmetic number, because the mean of its divisors is an integer number (1028579076).
Almost surely, 211102123020 is an apocalyptic number.
11102123020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102123020 is an abundant number, since it is smaller than the sum of its proper divisors (13583774804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102123020 is a wasteful number, since it uses less digits than its factorization.
11102123020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32653329 (or 32653327 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11102123020 its reverse (2032120111), we get a palindrome (13134243131).
The spelling of 11102123020 in words is "eleven billion, one hundred two million, one hundred twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •