Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101110001011111111011 |
3 | 10220020212120210011001000 |
4 | 100001120231301133323 |
5 | 121014322001201021 |
6 | 2201443055300043 |
7 | 142354543526421 |
oct | 20013055613773 |
9 | 3806776704030 |
10 | 1101000022011 |
11 | 394a2789a36a |
12 | 15946a81a623 |
13 | 7ca93022486 |
14 | 3b40821d111 |
15 | 1d98d688b26 |
hex | 10058b717fb |
1101000022011 has 32 divisors (see below), whose sum is σ = 1644221030400. Its totient is φ = 728121994560.
The previous prime is 1101000021967. The next prime is 1101000022049. The reversal of 1101000022011 is 1102200001011.
It is a happy number.
It is not a de Polignac number, because 1101000022011 - 213 = 1101000013819 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1101000021984 and 1101000022002.
It is not an unprimeable number, because it can be changed into a prime (1101000022091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1554015 + ... + 2148711.
It is an arithmetic number, because the mean of its divisors is an integer number (51381907200).
Almost surely, 21101000022011 is an apocalyptic number.
1101000022011 is a deficient number, since it is larger than the sum of its proper divisors (543221008389).
1101000022011 is a wasteful number, since it uses less digits than its factorization.
1101000022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595256 (or 595250 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101000022011 its reverse (1102200001011), we get a palindrome (2203200023022).
The spelling of 1101000022011 in words is "one trillion, one hundred one billion, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •