Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …1100111101000000001010 |
3 | 1110022021010212002110110112 |
4 | 2201202303030331000022 |
5 | 2423340230203310442 |
6 | 35335453301514322 |
7 | 2224015064111450 |
oct | 241426314750012 |
9 | 43267125073415 |
10 | 11101202010122 |
11 | 359aaa2144004 |
12 | 12b35a21129a2 |
13 | 626ab9c7cb93 |
14 | 2a54300ca9d0 |
15 | 143b7b1ca082 |
hex | a18b333d00a |
11101202010122 has 8 divisors (see below), whose sum is σ = 19030632017376. Its totient is φ = 4757658004332.
The previous prime is 11101202010113. The next prime is 11101202010169. The reversal of 11101202010122 is 22101020210111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 792943000723 = 11101202010122 / (1 + 1 + 1 + 0 + 1 + 2 + 0 + 2 + 0 + 1 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11101202010097 and 11101202010106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 396471500348 + ... + 396471500375.
It is an arithmetic number, because the mean of its divisors is an integer number (2378829002172).
Almost surely, 211101202010122 is an apocalyptic number.
11101202010122 is a deficient number, since it is larger than the sum of its proper divisors (7929430007254).
11101202010122 is an equidigital number, since it uses as much as digits as its factorization.
11101202010122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 792943000732.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11101202010122 its reverse (22101020210111), we get a palindrome (33202222220233).
The spelling of 11101202010122 in words is "eleven trillion, one hundred one billion, two hundred two million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •