Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …0101110101110101001010 |
3 | 1110100010101000111201100222 |
4 | 2201223023211311311022 |
5 | 2424012142441401442 |
6 | 35343542252030042 |
7 | 2224454066233544 |
oct | 241531345656512 |
9 | 43303330451328 |
10 | 11110201122122 |
11 | 35a389a989053 |
12 | 12b5293a62322 |
13 | 6278c24abc1b |
14 | 2a5a45350694 |
15 | 14400627d8d2 |
hex | a1acb975d4a |
11110201122122 has 8 divisors (see below), whose sum is σ = 16665373839972. Its totient is φ = 5555076508800.
The previous prime is 11110201122103. The next prime is 11110201122131. The reversal of 11110201122122 is 22122110201111.
It can be written as a sum of positive squares in 2 ways, for example, as 8281611972841 + 2828589149281 = 2877779^2 + 1681841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×111102011221223 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11110201122122.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11443079 + ... + 12375962.
Almost surely, 211110201122122 is an apocalyptic number.
11110201122122 is a deficient number, since it is larger than the sum of its proper divisors (5555172717850).
11110201122122 is a wasteful number, since it uses less digits than its factorization.
11110201122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24052264.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11110201122122 its reverse (22122110201111), we get a palindrome (33232311323233).
The spelling of 11110201122122 in words is "eleven trillion, one hundred ten billion, two hundred one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •