Base | Representation |
---|---|
bin | 1010000111011000101011… |
… | …1111000100110101010110 |
3 | 1110101020211110011112011021 |
4 | 2201312022333010311112 |
5 | 2424210330020320042 |
6 | 35353213252231354 |
7 | 2225352403120333 |
oct | 241661277046526 |
9 | 43336743145137 |
10 | 11122002120022 |
11 | 35a88a6279482 |
12 | 12b762800b55a |
13 | 628a53348711 |
14 | 2a644476998a |
15 | 1444972e0867 |
hex | a1d8afc4d56 |
11122002120022 has 8 divisors (see below), whose sum is σ = 16684019184672. Its totient is φ = 5560662391800.
The previous prime is 11122002120017. The next prime is 11122002120157. The reversal of 11122002120022 is 22002120022111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11122002119978 and 11122002120005.
It is a congruent number.
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, 169293054 + ... + 169358737.
It is an arithmetic number, because the mean of its divisors is an integer number (2085502398084).
Almost surely, 211122002120022 is an apocalyptic number.
11122002120022 is a deficient number, since it is larger than the sum of its proper divisors (5562017064650).
11122002120022 is a wasteful number, since it uses less digits than its factorization.
11122002120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338668214.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11122002120022 its reverse (22002120022111), we get a palindrome (33124122142133).
It can be divided in two parts, 111 and 22002120022, that multiplied together give a palindrome (2442235322442).
The spelling of 11122002120022 in words is "eleven trillion, one hundred twenty-two billion, two million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •