Base | Representation |
---|---|
bin | 10100111000010110… |
… | …01101111100111100 |
3 | 1001221020211011002102 |
4 | 22130023031330330 |
5 | 140424242333040 |
6 | 5052211444232 |
7 | 544540312400 |
oct | 123413157474 |
9 | 31836734072 |
10 | 11210121020 |
11 | 483290392a |
12 | 220a2b6678 |
13 | 1098616607 |
14 | 784b69100 |
15 | 459247515 |
hex | 29c2cdf3c |
11210121020 has 36 divisors (see below), whose sum is σ = 27384726600. Its totient is φ = 3843469728.
The previous prime is 11210121019. The next prime is 11210121029. The reversal of 11210121020 is 2012101211.
It is a junction number, because it is equal to n+sod(n) for n = 11210120992 and 11210121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210121029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5718470 + ... + 5720429.
It is an arithmetic number, because the mean of its divisors is an integer number (760686850).
Almost surely, 211210121020 is an apocalyptic number.
11210121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11210121020 is an abundant number, since it is smaller than the sum of its proper divisors (16174605580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210121020 is a wasteful number, since it uses less digits than its factorization.
11210121020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11438922 (or 11438913 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11210121020 its reverse (2012101211), we get a palindrome (13222222231).
The spelling of 11210121020 in words is "eleven billion, two hundred ten million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •