Base | Representation |
---|---|
bin | 11011010101011101011110… |
… | …010100111001101111010011 |
3 | 120202200010000201202021110021 |
4 | 123111131132110321233103 |
5 | 111224204140100320034 |
6 | 1103405121355044311 |
7 | 34215516351106165 |
oct | 3325353624715723 |
9 | 522603021667407 |
10 | 120222012120019 |
11 | 35340961729a37 |
12 | 115979b8740697 |
13 | 5210b6bc52624 |
14 | 2198ac2768935 |
15 | dd73b52ee6b4 |
hex | 6d575e539bd3 |
120222012120019 has 2 divisors, whose sum is σ = 120222012120020. Its totient is φ = 120222012120018.
The previous prime is 120222012119971. The next prime is 120222012120047. The reversal of 120222012120019 is 910021210222021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120222012120019 - 223 = 120222003731411 is a prime.
It is a super-2 number, since 2×1202220121200192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120222012119975 and 120222012120002.
It is not a weakly prime, because it can be changed into another prime (120222012121019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111006060009 + 60111006060010.
It is an arithmetic number, because the mean of its divisors is an integer number (60111006060010).
Almost surely, 2120222012120019 is an apocalyptic number.
120222012120019 is a deficient number, since it is larger than the sum of its proper divisors (1).
120222012120019 is an equidigital number, since it uses as much as digits as its factorization.
120222012120019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 120222012120019 in words is "one hundred twenty trillion, two hundred twenty-two billion, twelve million, one hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •