Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …110110011110111011100 |
3 | 10220100111001100022021000 |
4 | 100002110332303313130 |
5 | 121023404321333431 |
6 | 2202131254510300 |
7 | 142421601655263 |
oct | 20022476636734 |
9 | 3810431308230 |
10 | 1102011121116 |
11 | 3953a6604064 |
12 | 1596b1365390 |
13 | 7cbc4647579 |
14 | 3b4a26195da |
15 | 1d9ec30d9e6 |
hex | 10094fb3ddc |
1102011121116 has 48 divisors (see below), whose sum is σ = 2897306254080. Its totient is φ = 362163276720.
The previous prime is 1102011121111. The next prime is 1102011121117. The reversal of 1102011121116 is 6111211102011.
It is a super-2 number, since 2×11020111211162 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102011121111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71850126 + ... + 71865461.
It is an arithmetic number, because the mean of its divisors is an integer number (60360546960).
Almost surely, 21102011121116 is an apocalyptic number.
It is an amenable number.
1102011121116 is an abundant number, since it is smaller than the sum of its proper divisors (1795295132964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102011121116 is a wasteful number, since it uses less digits than its factorization.
1102011121116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143715671 (or 143715663 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 18.
Adding to 1102011121116 its reverse (6111211102011), we get a palindrome (7213222223127).
The spelling of 1102011121116 in words is "one trillion, one hundred two billion, eleven million, one hundred twenty-one thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •