Base | Representation |
---|---|
bin | 11011010101001001001011… |
… | …011010100011111111101001 |
3 | 120202121000210000000220000122 |
4 | 123111021023122203333221 |
5 | 111223330022310001413 |
6 | 1103351115130213025 |
7 | 34214115335125232 |
oct | 3325111332437751 |
9 | 522530700026018 |
10 | 120200220000233 |
11 | 3533269963888a |
12 | 11593736584175 |
13 | 520baa81b66a9 |
14 | 2197a1645c089 |
15 | dd6a3c085108 |
hex | 6d524b6a3fe9 |
120200220000233 has 2 divisors, whose sum is σ = 120200220000234. Its totient is φ = 120200220000232.
The previous prime is 120200220000193. The next prime is 120200220000239. The reversal of 120200220000233 is 332000022002021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115318453481449 + 4881766518784 = 10738643^2 + 2209472^2 .
It is a cyclic number.
It is not a de Polignac number, because 120200220000233 - 230 = 120199146258409 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (120200220000239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60100110000116 + 60100110000117.
It is an arithmetic number, because the mean of its divisors is an integer number (60100110000117).
Almost surely, 2120200220000233 is an apocalyptic number.
It is an amenable number.
120200220000233 is a deficient number, since it is larger than the sum of its proper divisors (1).
120200220000233 is an equidigital number, since it uses as much as digits as its factorization.
120200220000233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 120200220000233 its reverse (332000022002021), we get a palindrome (452200242002254).
The spelling of 120200220000233 in words is "one hundred twenty trillion, two hundred billion, two hundred twenty million, two hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •