Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1101000010100000101010 |
3 | 1102221200111121112112111001 |
4 | 2200011132231002200222 |
5 | 2420220022012010442 |
6 | 35221442323225214 |
7 | 2213540016033301 |
oct | 240053655024052 |
9 | 42850447475431 |
10 | 11001000110122 |
11 | 3561552848500 |
12 | 129809881820a |
13 | 61a50b69c3a9 |
14 | 2a0646311438 |
15 | 1412643ad2b7 |
hex | a015eb4282a |
11001000110122 has 36 divisors (see below), whose sum is σ = 18960909399810. Its totient is φ = 4783043470480.
The previous prime is 11001000110081. The next prime is 11001000110147. The reversal of 11001000110122 is 22101100010011.
It can be written as a sum of positive squares in only one way, i.e., 8490236267601 + 2510763842521 = 2913801^2 + 1584539^2 .
It is a super-2 number, since 2×110010001101222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001000110099 and 11001000110108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 42838597 + ... + 43094632.
Almost surely, 211001000110122 is an apocalyptic number.
11001000110122 is a deficient number, since it is larger than the sum of its proper divisors (7959909289688).
11001000110122 is a wasteful number, since it uses less digits than its factorization.
11001000110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85933299 (or 85933265 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11001000110122 its reverse (22101100010011), we get a palindrome (33102100120133).
The spelling of 11001000110122 in words is "eleven trillion, one billion, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •