Base | Representation |
---|---|
bin | 1010000000111000001100… |
… | …1100010011111000101010 |
3 | 1102222120020220221021001000 |
4 | 2200032003030103320222 |
5 | 2420342343232101442 |
6 | 35230003404335430 |
7 | 2214314034506205 |
oct | 240160314237052 |
9 | 42876226837030 |
10 | 11010202222122 |
11 | 3565445134444 |
12 | 1299a26544576 |
13 | 61b346c9608c |
14 | 2a0c7a4d893c |
15 | 1416021aed4c |
hex | a0383313e2a |
11010202222122 has 64 divisors (see below), whose sum is σ = 24663885557760. Its totient is φ = 3640561630272.
The previous prime is 11010202222087. The next prime is 11010202222141. The reversal of 11010202222122 is 22122220201011.
It is a happy number.
11010202222122 is a `hidden beast` number, since 110 + 10 + 202 + 222 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11010202222095 and 11010202222104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41929228 + ... + 42191000.
It is an arithmetic number, because the mean of its divisors is an integer number (385373211840).
Almost surely, 211010202222122 is an apocalyptic number.
11010202222122 is an abundant number, since it is smaller than the sum of its proper divisors (13653683335638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010202222122 is a wasteful number, since it uses less digits than its factorization.
11010202222122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268044 (or 268038 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11010202222122 its reverse (22122220201011), we get a palindrome (33132422423133).
The spelling of 11010202222122 in words is "eleven trillion, ten billion, two hundred two million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •