Base | Representation |
---|---|
bin | 10111001100100110110000… |
… | …100110101110000101010011 |
3 | 111101020010212021121121100211 |
4 | 113030212300212232011103 |
5 | 101333004131201402011 |
6 | 1000551540425224551 |
7 | 30326540305166245 |
oct | 2714466046560523 |
9 | 441203767547324 |
10 | 102021321122131 |
11 | 2a563aaa0a0654 |
12 | b5384ba032157 |
13 | 44c07529a6cc8 |
14 | 1b29c03206095 |
15 | bbdc1e4cbb21 |
hex | 5cc9b09ae153 |
102021321122131 has 2 divisors, whose sum is σ = 102021321122132. Its totient is φ = 102021321122130.
The previous prime is 102021321122111. The next prime is 102021321122233. The reversal of 102021321122131 is 131221123120201.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102021321122131 - 27 = 102021321122003 is a prime.
It is a super-2 number, since 2×1020213211221312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102021321122111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010660561065 + 51010660561066.
It is an arithmetic number, because the mean of its divisors is an integer number (51010660561066).
Almost surely, 2102021321122131 is an apocalyptic number.
102021321122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102021321122131 is an equidigital number, since it uses as much as digits as its factorization.
102021321122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 102021321122131 its reverse (131221123120201), we get a palindrome (233242444242332).
The spelling of 102021321122131 in words is "one hundred two trillion, twenty-one billion, three hundred twenty-one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •