Base | Representation |
---|---|
bin | 10111000000111110010110… |
… | …100011010101111010010101 |
3 | 111021101201201121202020020122 |
4 | 113000332112203111322111 |
5 | 101231410144122041041 |
6 | 555140430514441325 |
7 | 30215023006540514 |
oct | 2700762643257225 |
9 | 437351647666218 |
10 | 101222020112021 |
11 | 2a286021556356 |
12 | b429609893245 |
13 | 44632707a5023 |
14 | 1add259a3467b |
15 | ba803c75cc4b |
hex | 5c0f968d5e95 |
101222020112021 has 2 divisors, whose sum is σ = 101222020112022. Its totient is φ = 101222020112020.
The previous prime is 101222020111957. The next prime is 101222020112023. The reversal of 101222020112021 is 120211020222101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79962672574225 + 21259347537796 = 8942185^2 + 4610786^2 .
It is a cyclic number.
It is not a de Polignac number, because 101222020112021 - 26 = 101222020111957 is a prime.
Together with 101222020112023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101222020112023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50611010056010 + 50611010056011.
It is an arithmetic number, because the mean of its divisors is an integer number (50611010056011).
Almost surely, 2101222020112021 is an apocalyptic number.
It is an amenable number.
101222020112021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101222020112021 is an equidigital number, since it uses as much as digits as its factorization.
101222020112021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101222020112021 its reverse (120211020222101), we get a palindrome (221433040334122).
The spelling of 101222020112021 in words is "one hundred one trillion, two hundred twenty-two billion, twenty million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •