Base | Representation |
---|---|
bin | 101101111011101000101010… |
… | …010101101000000000010011 |
3 | 222111020222122022112220020012 |
4 | 231323220222111220000103 |
5 | 202434213343220041034 |
6 | 1553350112233105135 |
7 | 60356520061326440 |
oct | 5573505225500023 |
9 | 874228568486205 |
10 | 202010202112019 |
11 | 59404055773974 |
12 | 1a7a6b1bb581ab |
13 | 8894632357112 |
14 | 37c54bb4089c7 |
15 | 1854b37a4ecce |
hex | b7ba2a568013 |
202010202112019 has 8 divisors (see below), whose sum is σ = 231053645340000. Its totient is φ = 173012969615616.
The previous prime is 202010202112009. The next prime is 202010202112031. The reversal of 202010202112019 is 910211202010202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202010202112019 - 24 = 202010202112003 is a prime.
It is a super-2 number, since 2×2020102021120192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202010202111985 and 202010202112003.
It is not an unprimeable number, because it can be changed into a prime (202010202112009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11552673524 + ... + 11552691009.
It is an arithmetic number, because the mean of its divisors is an integer number (28881705667500).
Almost surely, 2202010202112019 is an apocalyptic number.
202010202112019 is a deficient number, since it is larger than the sum of its proper divisors (29043443227981).
202010202112019 is a wasteful number, since it uses less digits than its factorization.
202010202112019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23105365789.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 202010202112019 in words is "two hundred two trillion, ten billion, two hundred two million, one hundred twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •