Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0111010100011111011110 |
3 | 1102222120001021112000220120 |
4 | 2200031332113110133132 |
5 | 2420342212013101420 |
6 | 35225551352255410 |
7 | 2214312032146443 |
oct | 240157627243736 |
9 | 42876037460816 |
10 | 11010121222110 |
11 | 356540343a98a |
12 | 1299a033a1566 |
13 | 61b33327578a |
14 | 2a0c6d8519ca |
15 | 1415ea00ed40 |
hex | a037e5d47de |
11010121222110 has 32 divisors (see below), whose sum is σ = 26488898030880. Its totient is φ = 2928853759488.
The previous prime is 11010121222097. The next prime is 11010121222159. The reversal of 11010121222110 is 1122212101011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11010121222110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 448647927 + ... + 448672466.
It is an arithmetic number, because the mean of its divisors is an integer number (827778063465).
Almost surely, 211010121222110 is an apocalyptic number.
11010121222110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010121222110 is an abundant number, since it is smaller than the sum of its proper divisors (15478776808770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010121222110 is a wasteful number, since it uses less digits than its factorization.
11010121222110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897320812.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11010121222110 its reverse (1122212101011), we get a palindrome (12132333323121).
The spelling of 11010121222110 in words is "eleven trillion, ten billion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •