Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …000000101111101101111010 |
3 | 112102110220111020200121121112 |
4 | 121000231211000233231322 |
5 | 103404220202120041442 |
6 | 1025541203240240322 |
7 | 32112150034456535 |
oct | 3100554500575572 |
9 | 472426436617545 |
10 | 110000102112122 |
11 | 3205a865a44582 |
12 | 1040690b7700a2 |
13 | 494bc714a4431 |
14 | 1d24067721a1c |
15 | cab54d683082 |
hex | 640b6502fb7a |
110000102112122 has 4 divisors (see below), whose sum is σ = 165000153168186. Its totient is φ = 55000051056060.
The previous prime is 110000102112119. The next prime is 110000102112139. The reversal of 110000102112122 is 221211201000011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 71068255179601 + 38931846932521 = 8430199^2 + 6239539^2 .
It is a super-3 number, since 3×1100001021121223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110000102112097 and 110000102112106.
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 as a sum of consecutive naturals, namely, 27500025528029 + ... + 27500025528032.
Almost surely, 2110000102112122 is an apocalyptic number.
110000102112122 is a deficient number, since it is larger than the sum of its proper divisors (55000051056064).
110000102112122 is an equidigital number, since it uses as much as digits as its factorization.
110000102112122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55000051056063.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110000102112122 its reverse (221211201000011), we get a palindrome (331211303112133).
The spelling of 110000102112122 in words is "one hundred ten trillion, one hundred two million, one hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •