Base | Representation |
---|---|
bin | 101101111100111110010110… |
… | …100011111000001110010011 |
3 | 222111120210010122120121220021 |
4 | 231330332112203320032103 |
5 | 202442220312244213021 |
6 | 1553500250254324311 |
7 | 60366255135330265 |
oct | 5574762643701623 |
9 | 874523118517807 |
10 | 202102212101011 |
11 | 5943a080a34492 |
12 | 1a800919ab9697 |
13 | 88a02067102a1 |
14 | 37c9b29241b35 |
15 | 18572205b3c41 |
hex | b7cf968f8393 |
202102212101011 has 4 divisors (see below), whose sum is σ = 202429768361112. Its totient is φ = 201774655840912.
The previous prime is 202102212100993. The next prime is 202102212101039. The reversal of 202102212101011 is 110101212201202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202102212101011 - 233 = 202093622166419 is a prime.
It is a super-2 number, since 2×2021022121010112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202102212201011) 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, 163778129125 + ... + 163778130358.
It is an arithmetic number, because the mean of its divisors is an integer number (50607442090278).
Almost surely, 2202102212101011 is an apocalyptic number.
202102212101011 is a deficient number, since it is larger than the sum of its proper divisors (327556260101).
202102212101011 is an equidigital number, since it uses as much as digits as its factorization.
202102212101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327556260100.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 202102212101011 its reverse (110101212201202), we get a palindrome (312203424302213).
The spelling of 202102212101011 in words is "two hundred two trillion, one hundred two billion, two hundred twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •