Base | Representation |
---|---|
bin | 110000010000000101111011… |
… | …011111100111000100000100 |
3 | 1000211101021112220000000011222 |
4 | 300100011323133213010010 |
5 | 210303340400404341400 |
6 | 2031200521542415512 |
7 | 62461550640226313 |
oct | 6020057337470404 |
9 | 1024337486000158 |
10 | 212212111012100 |
11 | 61687718342a61 |
12 | 1b974166731598 |
13 | 9154693130384 |
14 | 3a59199d5c27a |
15 | 19801cd7d2185 |
hex | c1017b7e7104 |
212212111012100 has 36 divisors (see below), whose sum is σ = 460811219962548. Its totient is φ = 84827528448000.
The previous prime is 212212111012087. The next prime is 212212111012103. The reversal of 212212111012100 is 1210111212212.
It can be written as a sum of positive squares in 6 ways, for example, as 26860441482436 + 185351669529664 = 5182706^2 + 13614392^2 .
It is not an unprimeable number, because it can be changed into a prime (212212111012103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 716300621 + ... + 716596820.
Almost surely, 2212212111012100 is an apocalyptic number.
212212111012100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212212111012100 is an abundant number, since it is smaller than the sum of its proper divisors (248599108950448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212212111012100 is a wasteful number, since it uses less digits than its factorization.
212212111012100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1432898936 (or 1432898929 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212212111012100 its reverse (1210111212212), we get a palindrome (213422222224312).
The spelling of 212212111012100 in words is "two hundred twelve trillion, two hundred twelve billion, one hundred eleven million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •