Base | Representation |
---|---|
bin | 11001000010011111010011… |
… | …001101110010101000110010 |
3 | 112102220120200011102121120112 |
4 | 121002133103031302220302 |
5 | 103413220241242010002 |
6 | 1030113240034341322 |
7 | 32124032011356416 |
oct | 3102372315625062 |
9 | 472816604377515 |
10 | 110122210110002 |
11 | 320a76267aa702 |
12 | 1042650942a842 |
13 | 495a631319b0c |
14 | 1d29d2c9d6d46 |
15 | cae7e8730852 |
hex | 6427d3372a32 |
110122210110002 has 16 divisors (see below), whose sum is σ = 165920549104800. Its totient is φ = 54815388344928.
The previous prime is 110122210110001. The next prime is 110122210110061. The reversal of 110122210110002 is 200011012221011.
It is a super-2 number, since 2×1101222101100022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110122210110001) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 918374 + ... + 14869022.
It is an arithmetic number, because the mean of its divisors is an integer number (10370034319050).
Almost surely, 2110122210110002 is an apocalyptic number.
110122210110002 is a deficient number, since it is larger than the sum of its proper divisors (55798338994798).
110122210110002 is a wasteful number, since it uses less digits than its factorization.
110122210110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13968265.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110122210110002 its reverse (200011012221011), we get a palindrome (310133222331013).
The spelling of 110122210110002 in words is "one hundred ten trillion, one hundred twenty-two billion, two hundred ten million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •