Base | Representation |
---|---|
bin | 10111001100100101101001… |
… | …101110101010011111001011 |
3 | 111101020000210102010001221100 |
4 | 113030211221232222133023 |
5 | 101332444212244202334 |
6 | 1000551222430512443 |
7 | 30326465656046535 |
oct | 2714455156523713 |
9 | 441200712101840 |
10 | 102020132022219 |
11 | 2a56354995a254 |
12 | b538227965723 |
13 | 44c05c352aca8 |
14 | 1b29b2d312855 |
15 | bbdb9ede5c99 |
hex | 5cc969baa7cb |
102020132022219 has 6 divisors (see below), whose sum is σ = 147362412920996. Its totient is φ = 68013421348140.
The previous prime is 102020132022209. The next prime is 102020132022241. The reversal of 102020132022219 is 912220231020201.
102020132022219 is a `hidden beast` number, since 10 + 20 + 201 + 3 + 202 + 221 + 9 = 666.
It is not a de Polignac number, because 102020132022219 - 228 = 102019863586763 is a prime.
It is a super-2 number, since 2×1020201320222192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102020132022192 and 102020132022201.
It is not an unprimeable number, because it can be changed into a prime (102020132022209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5667785112337 + ... + 5667785112354.
Almost surely, 2102020132022219 is an apocalyptic number.
102020132022219 is a deficient number, since it is larger than the sum of its proper divisors (45342280898777).
102020132022219 is a wasteful number, since it uses less digits than its factorization.
102020132022219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11335570224697 (or 11335570224694 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 102020132022219 in words is "one hundred two trillion, twenty billion, one hundred thirty-two million, twenty-two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •