Base | Representation |
---|---|
bin | 1010000001100100100110… |
… | …0111101001010010000010 |
3 | 1110000201000120121122000220 |
4 | 2200121021213221102002 |
5 | 2421041301012223020 |
6 | 35235254221523510 |
7 | 2215215303316020 |
oct | 240311147512202 |
9 | 43021016548026 |
10 | 11022121211010 |
11 | 356a501094188 |
12 | 12a01b2113596 |
13 | 61c4c6405220 |
14 | 2a168b469710 |
15 | 141a9d77c240 |
hex | a06499e9482 |
11022121211010 has 128 divisors (see below), whose sum is σ = 32687364132864. Its totient is φ = 2316281184000.
The previous prime is 11022121211009. The next prime is 11022121211021. The reversal of 11022121211010 is 1011212122011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 7357414 + ... + 8727873.
It is an arithmetic number, because the mean of its divisors is an integer number (255370032288).
Almost surely, 211022121211010 is an apocalyptic number.
11022121211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11022121211010 is an abundant number, since it is smaller than the sum of its proper divisors (21665242921854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022121211010 is a wasteful number, since it uses less digits than its factorization.
11022121211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16085568.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11022121211010 its reverse (1011212122011), we get a palindrome (12033333333021).
The spelling of 11022121211010 in words is "eleven trillion, twenty-two billion, one hundred twenty-one million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •