Base | Representation |
---|---|
bin | 101101111011101001011001… |
… | …111001010100110111111111 |
3 | 222111021001200220220210202212 |
4 | 231323221121321110313333 |
5 | 202434222011444444444 |
6 | 1553350323334411035 |
7 | 60356545620265451 |
oct | 5573513171246777 |
9 | 874231626823685 |
10 | 202010999999999 |
11 | 594044250a1a23 |
12 | 1a7a7103200a7b |
13 | 889472b74a898 |
14 | 37c55553842d1 |
15 | 1854b82b0b19e |
hex | b7ba59e54dff |
202010999999999 has 2 divisors, whose sum is σ = 202011000000000. Its totient is φ = 202010999999998.
The previous prime is 202010999999959. The next prime is 202011000000001. The reversal of 202010999999999 is 999999999010202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202010999999999 - 232 = 202006705032703 is a prime.
Together with 202011000000001, it forms a pair of twin primes.
It is a Chen prime.
202010999999999 is a modest number, since divided by 99999999 gives 2020109 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 202010999999999.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202010999999929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101005499999999 + 101005500000000.
It is an arithmetic number, because the mean of its divisors is an integer number (101005500000000).
Almost surely, 2202010999999999 is an apocalyptic number.
202010999999999 is a deficient number, since it is larger than the sum of its proper divisors (1).
202010999999999 is an equidigital number, since it uses as much as digits as its factorization.
202010999999999 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1549681956, while the sum is 86.
The spelling of 202010999999999 in words is "two hundred two trillion, ten billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •