Base | Representation |
---|---|
bin | 1011110000100011001… |
… | …1011101101001010001 |
3 | 201022102111122210000101 |
4 | 2330020303131221101 |
5 | 11302204324441114 |
6 | 232445212252401 |
7 | 20411011424335 |
oct | 2741063355121 |
9 | 638374583011 |
10 | 202011171409 |
11 | 78744049033 |
12 | 33199171101 |
13 | 16084ba8328 |
14 | 9ac52477c5 |
15 | 53c4ce1d74 |
hex | 2f08cdda51 |
202011171409 has 2 divisors, whose sum is σ = 202011171410. Its totient is φ = 202011171408.
The previous prime is 202011171379. The next prime is 202011171419. The reversal of 202011171409 is 904171110202.
202011171409 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 can be written as a sum of positive squares in only one way, i.e., 194924899009 + 7086272400 = 441503^2 + 84180^2 .
It is a cyclic number.
It is not a de Polignac number, because 202011171409 - 217 = 202011040337 is a prime.
It is a super-4 number, since 4×2020111714094 (a number of 46 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (202011171419) 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, 101005585704 + 101005585705.
It is an arithmetic number, because the mean of its divisors is an integer number (101005585705).
Almost surely, 2202011171409 is an apocalyptic number.
It is an amenable number.
202011171409 is a deficient number, since it is larger than the sum of its proper divisors (1).
202011171409 is an equidigital number, since it uses as much as digits as its factorization.
202011171409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 28.
The spelling of 202011171409 in words is "two hundred two billion, eleven million, one hundred seventy-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •