Base | Representation |
---|---|
bin | 101101111011101010010110… |
… | …000110111100001110100101 |
3 | 222111021011022022210101102120 |
4 | 231323222112012330032211 |
5 | 202434231044102431041 |
6 | 1553351011502500153 |
7 | 60356612635000035 |
oct | 5573522606741645 |
9 | 874234268711376 |
10 | 202012010202021 |
11 | 594048a3353728 |
12 | 1a7a7345594659 |
13 | 889485cb1a566 |
14 | 37c560d5c98c5 |
15 | 1854be1655366 |
hex | b7ba961bc3a5 |
202012010202021 has 8 divisors (see below), whose sum is σ = 269529032964000. Its totient is φ = 134584830454032.
The previous prime is 202012010202019. The next prime is 202012010202043. The reversal of 202012010202021 is 120202010210202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202012010202021 - 21 = 202012010202019 is a prime.
It is a super-2 number, since 2×2020120102020212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202012010222021) 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, 22460748250 + ... + 22460757243.
It is an arithmetic number, because the mean of its divisors is an integer number (33691129120500).
Almost surely, 2202012010202021 is an apocalyptic number.
It is an amenable number.
202012010202021 is a deficient number, since it is larger than the sum of its proper divisors (67517022761979).
202012010202021 is a wasteful number, since it uses less digits than its factorization.
202012010202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44921506995.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202012010202021 its reverse (120202010210202), we get a palindrome (322214020412223).
The spelling of 202012010202021 in words is "two hundred two trillion, twelve billion, ten million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •