Base | Representation |
---|---|
bin | 110000001101001010101000… |
… | …111100001011001111011000 |
3 | 1000210200001110210222201122112 |
4 | 300031022220330023033120 |
5 | 210242042022030341440 |
6 | 2030524302522211452 |
7 | 62441201320022654 |
oct | 6015125074131730 |
9 | 1023601423881575 |
10 | 212011010012120 |
11 | 6160a401044220 |
12 | 1b9411a2353b88 |
13 | 913b7249a0327 |
14 | 3a4d55d95ba64 |
15 | 1979d5d87a965 |
hex | c0d2a8f0b3d8 |
212011010012120 has 64 divisors (see below), whose sum is σ = 522085744857600. Its totient is φ = 76843789188480.
The previous prime is 212011010012099. The next prime is 212011010012147. The reversal of 212011010012120 is 21210010110212.
It is a junction number, because it is equal to n+sod(n) for n = 212011010012095 and 212011010012104.
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, 784625840 + ... + 784895999.
It is an arithmetic number, because the mean of its divisors is an integer number (8157589763400).
Almost surely, 2212011010012120 is an apocalyptic number.
212011010012120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212011010012120 is an abundant number, since it is smaller than the sum of its proper divisors (310074734845480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212011010012120 is a wasteful number, since it uses less digits than its factorization.
212011010012120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1569522168 (or 1569522164 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212011010012120 its reverse (21210010110212), we get a palindrome (233221020122332).
The spelling of 212011010012120 in words is "two hundred twelve trillion, eleven billion, ten million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •