Base | Representation |
---|---|
bin | 10000101111000010101… |
… | …010001100111110010001 |
3 | 11001221102000111022010000 |
4 | 100233002222030332101 |
5 | 122320221130023441 |
6 | 2240151325000213 |
7 | 146041422441132 |
oct | 20570252147621 |
9 | 4057360438100 |
10 | 1150022111121 |
11 | 4037a35564a4 |
12 | 166a700b3069 |
13 | 845a62ba2b0 |
14 | 3d938b11c89 |
15 | 1edac2622b6 |
hex | 10bc2a8cf91 |
1150022111121 has 40 divisors (see below), whose sum is σ = 1862335517504. Its totient is φ = 703019023200.
The previous prime is 1150022111113. The next prime is 1150022111171. The reversal of 1150022111121 is 1211112200511.
It is a happy number.
1150022111121 is a `hidden beast` number, since 11 + 500 + 2 + 21 + 11 + 121 = 666.
It is not a de Polignac number, because 1150022111121 - 23 = 1150022111113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1150022111094 and 1150022111103.
It is not an unprimeable number, because it can be changed into a prime (1150022111171) 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 39 ways as a sum of consecutive naturals, for example, 3457351 + ... + 3775356.
Almost surely, 21150022111121 is an apocalyptic number.
It is an amenable number.
1150022111121 is a deficient number, since it is larger than the sum of its proper divisors (712313406383).
1150022111121 is a wasteful number, since it uses less digits than its factorization.
1150022111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7232883 (or 7232874 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 18.
Adding to 1150022111121 its reverse (1211112200511), we get a palindrome (2361134311632).
The spelling of 1150022111121 in words is "one trillion, one hundred fifty billion, twenty-two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •