Base | Representation |
---|---|
bin | 101101111101000101101100… |
… | …110101110101110110001011 |
3 | 222111121112111112000011200102 |
4 | 231331011230311311312023 |
5 | 202442332442114221022 |
6 | 1553504033224400015 |
7 | 60366654512246654 |
oct | 5575055465656613 |
9 | 874545445004612 |
10 | 202110102101387 |
11 | 5944245a700557 |
12 | 1a80236031600b |
13 | 88a0b9321b26c |
14 | 37ca27707452b |
15 | 18575330d1a92 |
hex | b7d16cd75d8b |
202110102101387 has 2 divisors, whose sum is σ = 202110102101388. Its totient is φ = 202110102101386.
The previous prime is 202110102101207. The next prime is 202110102101393. The reversal of 202110102101387 is 783101201011202.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202110102101387 - 224 = 202110085324171 is a prime.
It is a super-3 number, since 3×2021101021013873 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (202110102103387) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101055051050693 + 101055051050694.
It is an arithmetic number, because the mean of its divisors is an integer number (101055051050694).
Almost surely, 2202110102101387 is an apocalyptic number.
202110102101387 is a deficient number, since it is larger than the sum of its proper divisors (1).
202110102101387 is an equidigital number, since it uses as much as digits as its factorization.
202110102101387 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 29.
Adding to 202110102101387 its reverse (783101201011202), we get a palindrome (985211303112589).
The spelling of 202110102101387 in words is "two hundred two trillion, one hundred ten billion, one hundred two million, one hundred one thousand, three hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •