Base | Representation |
---|---|
bin | 110000001101000000011001… |
… | …010010100010010101110011 |
3 | 1000210122000002012120020111210 |
4 | 300031000121102202111303 |
5 | 210241402010031121321 |
6 | 2030515243214211203 |
7 | 62440331610442500 |
oct | 6015003122422563 |
9 | 1023560065506453 |
10 | 212000010020211 |
11 | 61605776911516 |
12 | 1b93b0324b3b03 |
13 | 913a690a7958a |
14 | 3a4cbd8a904a7 |
15 | 1979917cddb76 |
hex | c0d0194a2573 |
212000010020211 has 48 divisors (see below), whose sum is σ = 333760540450560. Its totient is φ = 119321711530560.
The previous prime is 212000010020209. The next prime is 212000010020261. The reversal of 212000010020211 is 112020010000212.
It is not a de Polignac number, because 212000010020211 - 21 = 212000010020209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212000010020261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 89251410 + ... + 91595928.
It is an arithmetic number, because the mean of its divisors is an integer number (6953344592720).
Almost surely, 2212000010020211 is an apocalyptic number.
212000010020211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
212000010020211 is a deficient number, since it is larger than the sum of its proper divisors (121760530430349).
212000010020211 is a wasteful number, since it uses less digits than its factorization.
212000010020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2353784 (or 2353777 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212000010020211 its reverse (112020010000212), we get a palindrome (324020020020423).
The spelling of 212000010020211 in words is "two hundred twelve trillion, ten million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •