Base | Representation |
---|---|
bin | 111000110100100010… |
… | …1110101000011101101 |
3 | 102122221221100000211222 |
4 | 1301221011311003231 |
5 | 3444400142020023 |
6 | 132020051353125 |
7 | 11546552520401 |
oct | 1615105650355 |
9 | 378857300758 |
10 | 122022220013 |
11 | 478273a8a31 |
12 | 1b794bb27a5 |
13 | b678141465 |
14 | 5c97b47101 |
15 | 32927a6cc8 |
hex | 1c691750ed |
122022220013 has 8 divisors (see below), whose sum is σ = 122374768896. Its totient is φ = 121669912000.
The previous prime is 122022219997. The next prime is 122022220027. The reversal of 122022220013 is 310022220221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122022220013 - 24 = 122022219997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122022219973 and 122022220000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122022220213) 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 7 ways as a sum of consecutive naturals, for example, 980270 + ... + 1097712.
It is an arithmetic number, because the mean of its divisors is an integer number (15296846112).
Almost surely, 2122022220013 is an apocalyptic number.
It is an amenable number.
122022220013 is a deficient number, since it is larger than the sum of its proper divisors (352548883).
122022220013 is a wasteful number, since it uses less digits than its factorization.
122022220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120435.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 122022220013 its reverse (310022220221), we get a palindrome (432044440234).
The spelling of 122022220013 in words is "one hundred twenty-two billion, twenty-two million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •