Base | Representation |
---|---|
bin | 11001001111010010101011… |
… | …011100100111000111011011 |
3 | 112120000200121000101212002111 |
4 | 121033102223130213013123 |
5 | 104022124104331431021 |
6 | 1032025341525213151 |
7 | 32244426213304366 |
oct | 3117225334470733 |
9 | 476020530355074 |
10 | 111002011202011 |
11 | 32406763563a06 |
12 | 10548b24b611b7 |
13 | 49c25a2137057 |
14 | 1d5a75151b0dd |
15 | cc763c8008e1 |
hex | 64f4ab7271db |
111002011202011 has 8 divisors (see below), whose sum is σ = 114217997762880. Its totient is φ = 107814867570312.
The previous prime is 111002011202003. The next prime is 111002011202023. The reversal of 111002011202011 is 110202110200111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111002011202011 - 23 = 111002011202003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111002011201982 and 111002011202000.
It is not an unprimeable number, because it can be changed into a prime (111002011202051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7210724485 + ... + 7210739878.
It is an arithmetic number, because the mean of its divisors is an integer number (14277249720360).
Almost surely, 2111002011202011 is an apocalyptic number.
111002011202011 is a deficient number, since it is larger than the sum of its proper divisors (3215986560869).
111002011202011 is a wasteful number, since it uses less digits than its factorization.
111002011202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14421464585.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111002011202011 its reverse (110202110200111), we get a palindrome (221204121402122).
The spelling of 111002011202011 in words is "one hundred eleven trillion, two billion, eleven million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •