Base | Representation |
---|---|
bin | 101101111011101000100100… |
… | …111110010101010010111001 |
3 | 222111020222102001012211101012 |
4 | 231323220210332111102321 |
5 | 202434213202200314433 |
6 | 1553350055300203305 |
7 | 60356514616366142 |
oct | 5573504476252271 |
9 | 874228361184335 |
10 | 202010112119993 |
11 | 594040099985a1 |
12 | 1a7a6ab5999535 |
13 | 88946198089b8 |
14 | 37c54ad4a0ac9 |
15 | 1854b2ebc5848 |
hex | b7ba24f954b9 |
202010112119993 has 2 divisors, whose sum is σ = 202010112119994. Its totient is φ = 202010112119992.
The previous prime is 202010112119909. The next prime is 202010112120029. The reversal of 202010112119993 is 399911211010202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196719615308329 + 5290496811664 = 14025677^2 + 2300108^2 .
It is a cyclic number.
It is not a de Polignac number, because 202010112119993 - 236 = 201941392643257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 202010112119993.
It is not a weakly prime, because it can be changed into another prime (202010112119093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101005056059996 + 101005056059997.
It is an arithmetic number, because the mean of its divisors is an integer number (101005056059997).
Almost surely, 2202010112119993 is an apocalyptic number.
It is an amenable number.
202010112119993 is a deficient number, since it is larger than the sum of its proper divisors (1).
202010112119993 is an equidigital number, since it uses as much as digits as its factorization.
202010112119993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 41.
The spelling of 202010112119993 in words is "two hundred two trillion, ten billion, one hundred twelve million, one hundred nineteen thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •