Base | Representation |
---|---|
bin | 10111001100010010111011… |
… | …000101000011100010100101 |
3 | 111101011002212220120121022202 |
4 | 113030102323011003202211 |
5 | 101332132021113310041 |
6 | 1000534055131304245 |
7 | 30325154426550422 |
oct | 2714227305034245 |
9 | 441132786517282 |
10 | 102000022010021 |
11 | 2a555a6a320463 |
12 | b534354bab085 |
13 | 44bb73a1155a5 |
14 | 1b28b82590d49 |
15 | bbd3c4698a9b |
hex | 5cc4bb1438a5 |
102000022010021 has 16 divisors (see below), whose sum is σ = 103835247035520. Its totient is φ = 100170070960320.
The previous prime is 102000022010011. The next prime is 102000022010027. The reversal of 102000022010021 is 120010220000201.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102000022010021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102000022009984 and 102000022010011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000022010027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1447615490 + ... + 1447685948.
It is an arithmetic number, because the mean of its divisors is an integer number (6489702939720).
Almost surely, 2102000022010021 is an apocalyptic number.
It is an amenable number.
102000022010021 is a deficient number, since it is larger than the sum of its proper divisors (1835225025499).
102000022010021 is an equidigital number, since it uses as much as digits as its factorization.
102000022010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107516.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 102000022010021 its reverse (120010220000201), we get a palindrome (222010242010222).
The spelling of 102000022010021 in words is "one hundred two trillion, twenty-two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •