Base | Representation |
---|---|
bin | 10111001100100111011010… |
… | …010101000000001111111101 |
3 | 111101020012200001210020022122 |
4 | 113030213122111000033331 |
5 | 101333012044401333041 |
6 | 1000552134112452325 |
7 | 30326563535114321 |
oct | 2714473225001775 |
9 | 441205601706278 |
10 | 102022021121021 |
11 | 2a56432923a131 |
12 | b53867454a0a5 |
13 | 44c0834a15a31 |
14 | 1b29c6c17d981 |
15 | bbdc60b9dc4b |
hex | 5cc9da5403fd |
102022021121021 has 4 divisors (see below), whose sum is σ = 102022041367200. Its totient is φ = 102022000874844.
The previous prime is 102022021121017. The next prime is 102022021121047. The reversal of 102022021121021 is 120121120220201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102022021121021 - 22 = 102022021121017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022021121051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4049840 + ... + 14847398.
It is an arithmetic number, because the mean of its divisors is an integer number (25505510341800).
Almost surely, 2102022021121021 is an apocalyptic number.
It is an amenable number.
102022021121021 is a deficient number, since it is larger than the sum of its proper divisors (20246179).
102022021121021 is an equidigital number, since it uses as much as digits as its factorization.
102022021121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20246178.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102022021121021 its reverse (120121120220201), we get a palindrome (222143141341222).
The spelling of 102022021121021 in words is "one hundred two trillion, twenty-two billion, twenty-one million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •