Base | Representation |
---|---|
bin | 1011110001010000100… |
… | …1011010010101101011 |
3 | 201022220202202011122201 |
4 | 2330110021122111223 |
5 | 11303102034140121 |
6 | 232520131201031 |
7 | 20415512113516 |
oct | 2742411322553 |
9 | 638822664581 |
10 | 202201474411 |
11 | 78831508542 |
12 | 33230a46177 |
13 | 160b5448961 |
14 | 9b02623d7d |
15 | 53d6882e91 |
hex | 2f1425a56b |
202201474411 has 2 divisors, whose sum is σ = 202201474412. Its totient is φ = 202201474410.
The previous prime is 202201474379. The next prime is 202201474421. The reversal of 202201474411 is 114474102202.
202201474411 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 202201474411 - 25 = 202201474379 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202201474411.
It is not a weakly prime, because it can be changed into another prime (202201474421) 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, 101100737205 + 101100737206.
It is an arithmetic number, because the mean of its divisors is an integer number (101100737206).
Almost surely, 2202201474411 is an apocalyptic number.
202201474411 is a deficient number, since it is larger than the sum of its proper divisors (1).
202201474411 is an equidigital number, since it uses as much as digits as its factorization.
202201474411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3584, while the sum is 28.
Adding to 202201474411 its reverse (114474102202), we get a palindrome (316675576613).
The spelling of 202201474411 in words is "two hundred two billion, two hundred one million, four hundred seventy-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •