Base | Representation |
---|---|
bin | 111000111010001111… |
… | …0011100101011010000 |
3 | 102200110020201222212010 |
4 | 1301310132130223100 |
5 | 4000243041114440 |
6 | 132051033302520 |
7 | 11554362153642 |
oct | 1616436345320 |
9 | 380406658763 |
10 | 122213223120 |
11 | 479151a643a |
12 | 1b828b64a40 |
13 | b6a8898651 |
14 | 5cb5266892 |
15 | 32a4435580 |
hex | 1c7479cad0 |
122213223120 has 80 divisors (see below), whose sum is σ = 388101534912. Its totient is φ = 31795307520.
The previous prime is 122213223107. The next prime is 122213223133. The reversal of 122213223120 is 21322312221.
It is an interprime number because it is at equal distance from previous prime (122213223107) and next prime (122213223133).
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 6200182 + ... + 6219861.
Almost surely, 2122213223120 is an apocalyptic number.
122213223120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122213223120 is an abundant number, since it is smaller than the sum of its proper divisors (265888311792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122213223120 is a wasteful number, since it uses less digits than its factorization.
122213223120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12420100 (or 12420094 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 122213223120 its reverse (21322312221), we get a palindrome (143535535341).
The spelling of 122213223120 in words is "one hundred twenty-two billion, two hundred thirteen million, two hundred twenty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •