Base | Representation |
---|---|
bin | 110000001101010100000010… |
… | …010110011110000111110100 |
3 | 1000210201000112000002211102112 |
4 | 300031110002112132013310 |
5 | 210242223203100341040 |
6 | 2030533052042030152 |
7 | 62442006336430205 |
oct | 6015240226360764 |
9 | 1023630460084375 |
10 | 212021100012020 |
11 | 6161370963a512 |
12 | 1b9431394a8358 |
13 | 913c67220c680 |
14 | 3a4dc39a2b5ac |
15 | 197a24e5b5365 |
hex | c0d50259e1f4 |
212021100012020 has 48 divisors (see below), whose sum is σ = 480049485672960. Its totient is φ = 78194001469056.
The previous prime is 212021100012019. The next prime is 212021100012103. The reversal of 212021100012020 is 20210001120212.
It is a junction number, because it is equal to n+sod(n) for n = 212021100011986 and 212021100012004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 472235510 + ... + 472684269.
It is an arithmetic number, because the mean of its divisors is an integer number (10001030951520).
Almost surely, 2212021100012020 is an apocalyptic number.
212021100012020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212021100012020 is an abundant number, since it is smaller than the sum of its proper divisors (268028385660940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212021100012020 is a wasteful number, since it uses less digits than its factorization.
212021100012020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944920664 (or 944920662 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212021100012020 its reverse (20210001120212), we get a palindrome (232231101132232).
The spelling of 212021100012020 in words is "two hundred twelve trillion, twenty-one billion, one hundred million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •