Base | Representation |
---|---|
bin | 1010000110000111001010… |
… | …1101110011000010011110 |
3 | 1110022011100110021210012010 |
4 | 2201201302231303002132 |
5 | 2423331021221213042 |
6 | 35335154052452050 |
7 | 2223646216043511 |
oct | 241416255630236 |
9 | 43264313253163 |
10 | 11100120101022 |
11 | 359a597465757 |
12 | 12b333b91a026 |
13 | 626976a94694 |
14 | 2a536a53ad78 |
15 | 143b1621959c |
hex | a1872b7309e |
11100120101022 has 8 divisors (see below), whose sum is σ = 22200240202056. Its totient is φ = 3700040033672.
The previous prime is 11100120101017. The next prime is 11100120101053. The reversal of 11100120101022 is 22010102100111.
It is a sphenic number, since it is the product of 3 distinct primes.
11100120101022 is an admirable number.
It is a super-2 number, since 2×111001201010222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11100120100989 and 11100120101007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 925010008413 + ... + 925010008424.
It is an arithmetic number, because the mean of its divisors is an integer number (2775030025257).
Almost surely, 211100120101022 is an apocalyptic number.
11100120101022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100120101022 is a wasteful number, since it uses less digits than its factorization.
11100120101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1850020016842.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100120101022 its reverse (22010102100111), we get a palindrome (33110222201133).
The spelling of 11100120101022 in words is "eleven trillion, one hundred billion, one hundred twenty million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •