Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …111000110110111110111101 |
3 | 111101111122222022112121101211 |
4 | 113031300002320312332331 |
5 | 101340301310310121341 |
6 | 1001052033023004421 |
7 | 30335324311244614 |
oct | 2715600270667675 |
9 | 441448868477354 |
10 | 102100011020221 |
11 | 2a59440a52a785 |
12 | b54b7bb139711 |
13 | 44c7cb3577a96 |
14 | 1b2d949d9087b |
15 | bc0cc7962181 |
hex | 5cdc02e36fbd |
102100011020221 has 2 divisors, whose sum is σ = 102100011020222. Its totient is φ = 102100011020220.
The previous prime is 102100011020201. The next prime is 102100011020261. The reversal of 102100011020221 is 122020110001201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101013957324900 + 1086053695321 = 10050570^2 + 1042139^2 .
It is an emirp because it is prime and its reverse (122020110001201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102100011020221 - 233 = 102091421085629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102100011020201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050005510110 + 51050005510111.
It is an arithmetic number, because the mean of its divisors is an integer number (51050005510111).
Almost surely, 2102100011020221 is an apocalyptic number.
It is an amenable number.
102100011020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100011020221 is an equidigital number, since it uses as much as digits as its factorization.
102100011020221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102100011020221 its reverse (122020110001201), we get a palindrome (224120121021422).
The spelling of 102100011020221 in words is "one hundred two trillion, one hundred billion, eleven million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •