Base | Representation |
---|---|
bin | 111000111010011110… |
… | …0001100011111000010 |
3 | 102200110210102011201000 |
4 | 1301310330030133002 |
5 | 4000302040133442 |
6 | 132051512352430 |
7 | 11554515352434 |
oct | 1616474143702 |
9 | 380423364630 |
10 | 122221021122 |
11 | 47919642172 |
12 | 1b82b6a5716 |
13 | b6aa398b55 |
14 | 5cb62d6654 |
15 | 32a4e75d4c |
hex | 1c74f0c7c2 |
122221021122 has 16 divisors (see below), whose sum is σ = 271602269280. Its totient is φ = 40740340356.
The previous prime is 122221021103. The next prime is 122221021157. The reversal of 122221021122 is 221120122221.
It is a happy number.
122221021122 is a `hidden beast` number, since 1 + 222 + 210 + 211 + 22 = 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 = 122221021095 and 122221021104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1131676068 + ... + 1131676175.
It is an arithmetic number, because the mean of its divisors is an integer number (16975141830).
Almost surely, 2122221021122 is an apocalyptic number.
122221021122 is an abundant number, since it is smaller than the sum of its proper divisors (149381248158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122221021122 is a wasteful number, since it uses less digits than its factorization.
122221021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2263352254 (or 2263352248 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 122221021122 its reverse (221120122221), we get a palindrome (343341143343).
The spelling of 122221021122 in words is "one hundred twenty-two billion, two hundred twenty-one million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •