Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …010000101110111011011 |
3 | 10221022021222021001100111 |
4 | 100023221002011313123 |
5 | 121204344331431021 |
6 | 2210503443145151 |
7 | 143224450155133 |
oct | 20135102056733 |
9 | 3838258231314 |
10 | 1112011202011 |
11 | 399668373926 |
12 | 15b6223751b7 |
13 | 80b293627b8 |
14 | 3bb7079dac3 |
15 | 1ddd51d58e1 |
hex | 102e9085ddb |
1112011202011 has 8 divisors (see below), whose sum is σ = 1170561036800. Its totient is φ = 1053463660200.
The previous prime is 1112011201993. The next prime is 1112011202039. The reversal of 1112011202011 is 1102021102111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1112011202011 - 223 = 1112002813403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112011201982 and 1112011202000.
It is not an unprimeable number, because it can be changed into a prime (1112011202051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 471010 + ... + 1563928.
It is an arithmetic number, because the mean of its divisors is an integer number (146320129600).
Almost surely, 21112011202011 is an apocalyptic number.
1112011202011 is a deficient number, since it is larger than the sum of its proper divisors (58549834789).
1112011202011 is a wasteful number, since it uses less digits than its factorization.
1112011202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1146489.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1112011202011 its reverse (1102021102111), we get a palindrome (2214032304122).
The spelling of 1112011202011 in words is "one trillion, one hundred twelve billion, eleven million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •