Base | Representation |
---|---|
bin | 111000111010001101… |
… | …0001010111110000011 |
3 | 102200110011122000222212 |
4 | 1301310122022332003 |
5 | 4000242244231034 |
6 | 132050553252335 |
7 | 11554346504300 |
oct | 1616432127603 |
9 | 380404560885 |
10 | 122212102019 |
11 | 47914600107 |
12 | 1b8287040ab |
13 | b6a8595287 |
14 | 5cb50540a7 |
15 | 32a42b32ce |
hex | 1c7468af83 |
122212102019 has 48 divisors (see below), whose sum is σ = 149842008576. Its totient is φ = 99193248000.
The previous prime is 122212102003. The next prime is 122212102037. The reversal of 122212102019 is 910201212221.
It is not a de Polignac number, because 122212102019 - 24 = 122212102003 is a prime.
It is a super-2 number, since 2×1222121020192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122212101985 and 122212102003.
It is not an unprimeable number, because it can be changed into a prime (122212102039) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 57348584 + ... + 57350714.
It is an arithmetic number, because the mean of its divisors is an integer number (3121708512).
Almost surely, 2122212102019 is an apocalyptic number.
122212102019 is a deficient number, since it is larger than the sum of its proper divisors (27629906557).
122212102019 is a wasteful number, since it uses less digits than its factorization.
122212102019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2656 (or 2649 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 122212102019 in words is "one hundred twenty-two billion, two hundred twelve million, one hundred two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •