Base | Representation |
---|---|
bin | 1011110001000011111… |
… | …0000101010000101001 |
3 | 201022210001110011122111 |
4 | 2330100332011100221 |
5 | 11302444413012331 |
6 | 232510544522321 |
7 | 20414264055406 |
oct | 2742076052051 |
9 | 638701404574 |
10 | 202148172841 |
11 | 7880441225a |
12 | 332170203a1 |
13 | 160a73a5874 |
14 | 9ad950b2ad |
15 | 53d1d54db1 |
hex | 2f10f85429 |
202148172841 has 2 divisors, whose sum is σ = 202148172842. Its totient is φ = 202148172840.
The previous prime is 202148172781. The next prime is 202148172871. The reversal of 202148172841 is 148271841202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 176151447616 + 25996725225 = 419704^2 + 161235^2 .
It is a cyclic number.
It is not a de Polignac number, because 202148172841 - 213 = 202148164649 is a prime.
It is a super-2 number, since 2×2021481728412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202148172794 and 202148172803.
It is not a weakly prime, because it can be changed into another prime (202148172871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101074086420 + 101074086421.
It is an arithmetic number, because the mean of its divisors is an integer number (101074086421).
Almost surely, 2202148172841 is an apocalyptic number.
It is an amenable number.
202148172841 is a deficient number, since it is larger than the sum of its proper divisors (1).
202148172841 is an equidigital number, since it uses as much as digits as its factorization.
202148172841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57344, while the sum is 40.
The spelling of 202148172841 in words is "two hundred two billion, one hundred forty-eight million, one hundred seventy-two thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •