Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0101010100011101100010 |
3 | 1110022100012112202111200020 |
4 | 2201203202311110131202 |
5 | 2423343344241333442 |
6 | 35340104445334310 |
7 | 2224043636333232 |
oct | 241434265243542 |
9 | 43270175674606 |
10 | 11102001121122 |
11 | 35a0372227a1a |
12 | 12b3785867396 |
13 | 626bb66b1222 |
14 | 2a54a82a3cc2 |
15 | 143bc64289ec |
hex | a18e2d54762 |
11102001121122 has 8 divisors (see below), whose sum is σ = 22204002242256. Its totient is φ = 3700667040372.
The previous prime is 11102001121121. The next prime is 11102001121163. The reversal of 11102001121122 is 22112110020111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
11102001121122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (11102001121121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 925166760088 + ... + 925166760099.
It is an arithmetic number, because the mean of its divisors is an integer number (2775500280282).
Almost surely, 211102001121122 is an apocalyptic number.
11102001121122 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.
11102001121122 is a wasteful number, since it uses less digits than its factorization.
11102001121122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1850333520192.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11102001121122 its reverse (22112110020111), we get a palindrome (33214111141233).
It can be divided in two parts, 1110200 and 1121122, that added together give a palindrome (2231322).
The spelling of 11102001121122 in words is "eleven trillion, one hundred two billion, one million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •