Base | Representation |
---|---|
bin | 1011110001000101110… |
… | …0111000000110110011 |
3 | 201022210121122022011011 |
4 | 2330101130320012303 |
5 | 11303003444323202 |
6 | 232511433531351 |
7 | 20414422506553 |
oct | 2742134700663 |
9 | 638717568134 |
10 | 202156245427 |
11 | 78808a26314 |
12 | 33219873b57 |
13 | 160a8c71046 |
14 | 9ada60d163 |
15 | 53d28ebbd7 |
hex | 2f117381b3 |
202156245427 has 2 divisors, whose sum is σ = 202156245428. Its totient is φ = 202156245426.
The previous prime is 202156245413. The next prime is 202156245437. The reversal of 202156245427 is 724542651202.
202156245427 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202156245427 - 219 = 202155721139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202156245427.
It is not a weakly prime, because it can be changed into another prime (202156245437) 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 as a sum of consecutive naturals, namely, 101078122713 + 101078122714.
It is an arithmetic number, because the mean of its divisors is an integer number (101078122714).
Almost surely, 2202156245427 is an apocalyptic number.
202156245427 is a deficient number, since it is larger than the sum of its proper divisors (1).
202156245427 is an equidigital number, since it uses as much as digits as its factorization.
202156245427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 268800, while the sum is 40.
Adding to 202156245427 its reverse (724542651202), we get a palindrome (926698896629).
The spelling of 202156245427 in words is "two hundred two billion, one hundred fifty-six million, two hundred forty-five thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •