Base | Representation |
---|---|
bin | 11011101111011111101100… |
… | …111111011001100000110011 |
3 | 121000000011000011211222201112 |
4 | 123233133230333121200303 |
5 | 111443012224134120034 |
6 | 1111255044151023535 |
7 | 34462004045252105 |
oct | 3357375477314063 |
9 | 530004004758645 |
10 | 122011112020019 |
11 | 35970692a04112 |
12 | 118266a266abab |
13 | 53107a1b7a301 |
14 | 221b52562d575 |
15 | e18bc7e4d7ce |
hex | 6ef7ecfd9833 |
122011112020019 has 2 divisors, whose sum is σ = 122011112020020. Its totient is φ = 122011112020018.
The previous prime is 122011112020001. The next prime is 122011112020033. The reversal of 122011112020019 is 910020211110221.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122011112020019 - 232 = 122006817052723 is a prime.
It is a super-2 number, since 2×1220111120200192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122011112019976 and 122011112020003.
It is not a weakly prime, because it can be changed into another prime (122011112020219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61005556010009 + 61005556010010.
It is an arithmetic number, because the mean of its divisors is an integer number (61005556010010).
Almost surely, 2122011112020019 is an apocalyptic number.
122011112020019 is a deficient number, since it is larger than the sum of its proper divisors (1).
122011112020019 is an equidigital number, since it uses as much as digits as its factorization.
122011112020019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 122011112020019 in words is "one hundred twenty-two trillion, eleven billion, one hundred twelve million, twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •