Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1010100110100001100111 |
3 | 1102222201221202100202001212 |
4 | 2200033233222212201213 |
5 | 2420410110124231434 |
6 | 35230504134542035 |
7 | 2214410113312613 |
oct | 240175752464147 |
9 | 42881852322055 |
10 | 11012022102119 |
11 | 35661994371a5 |
12 | 129a253b0791b |
13 | 61b577026a4c |
14 | 2a0db00a8343 |
15 | 1416abd438ce |
hex | a03efaa6867 |
11012022102119 has 16 divisors (see below), whose sum is σ = 11700953379360. Its totient is φ = 10327696558080.
The previous prime is 11012022102061. The next prime is 11012022102143. The reversal of 11012022102119 is 91120122021011.
It is a happy number.
It is not a de Polignac number, because 11012022102119 - 216 = 11012022036583 is a prime.
It is a super-2 number, since 2×110120221021192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012022102094 and 11012022102103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012022402119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10606127 + ... + 11598015.
It is an arithmetic number, because the mean of its divisors is an integer number (731309586210).
Almost surely, 211012022102119 is an apocalyptic number.
11012022102119 is a deficient number, since it is larger than the sum of its proper divisors (688931277241).
11012022102119 is a wasteful number, since it uses less digits than its factorization.
11012022102119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 994210.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 11012022102119 in words is "eleven trillion, twelve billion, twenty-two million, one hundred two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •