Base | Representation |
---|---|
bin | 10111001100100101100011… |
… | …001011010101111111100001 |
3 | 111101020000111202021102220201 |
4 | 113030211203023111333201 |
5 | 101332444001124144222 |
6 | 1000551203502505201 |
7 | 30326463152530444 |
oct | 2714454313257741 |
9 | 441200452242821 |
10 | 102020022099937 |
11 | 2a5634a2900a97 |
12 | b5381b6b95201 |
13 | 44c05a6822116 |
14 | 1b29b1c89b65b |
15 | bbdb95431427 |
hex | 5cc9632d5fe1 |
102020022099937 has 2 divisors, whose sum is σ = 102020022099938. Its totient is φ = 102020022099936.
The previous prime is 102020022099929. The next prime is 102020022099949. The reversal of 102020022099937 is 739990220020201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99233155789056 + 2786866310881 = 9961584^2 + 1669391^2 .
It is an emirp because it is prime and its reverse (739990220020201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102020022099937 - 23 = 102020022099929 is a prime.
It is a super-3 number, since 3×1020200220999373 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (102020022099967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010011049968 + 51010011049969.
It is an arithmetic number, because the mean of its divisors is an integer number (51010011049969).
Almost surely, 2102020022099937 is an apocalyptic number.
It is an amenable number.
102020022099937 is a deficient number, since it is larger than the sum of its proper divisors (1).
102020022099937 is an equidigital number, since it uses as much as digits as its factorization.
102020022099937 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 244944, while the sum is 46.
The spelling of 102020022099937 in words is "one hundred two trillion, twenty billion, twenty-two million, ninety-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •