Base | Representation |
---|---|
bin | 110111111110010011… |
… | …1000011001110011101 |
3 | 102111021002200001120011 |
4 | 1233330213003032131 |
5 | 3432133231243003 |
6 | 131115314323221 |
7 | 11453502642334 |
oct | 1577447031635 |
9 | 374232601504 |
10 | 120202212253 |
11 | 46a83019192 |
12 | 1b367589511 |
13 | b4480675a6 |
14 | 5b64142d1b |
15 | 31d7aea46d |
hex | 1bfc9c339d |
120202212253 has 2 divisors, whose sum is σ = 120202212254. Its totient is φ = 120202212252.
The previous prime is 120202212203. The next prime is 120202212283. The reversal of 120202212253 is 352212202021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76588902009 + 43613310244 = 276747^2 + 208838^2 .
It is an emirp because it is prime and its reverse (352212202021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120202212253 - 213 = 120202204061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120202212203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60101106126 + 60101106127.
It is an arithmetic number, because the mean of its divisors is an integer number (60101106127).
Almost surely, 2120202212253 is an apocalyptic number.
It is an amenable number.
120202212253 is a deficient number, since it is larger than the sum of its proper divisors (1).
120202212253 is an equidigital number, since it uses as much as digits as its factorization.
120202212253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 120202212253 its reverse (352212202021), we get a palindrome (472414414274).
The spelling of 120202212253 in words is "one hundred twenty billion, two hundred two million, two hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •