Base | Representation |
---|---|
bin | 1010001100101000101111… |
… | …0110101110000110110010 |
3 | 1110200212200021010110110121 |
4 | 2203022023312232012302 |
5 | 2432200102010121320 |
6 | 35502452454120454 |
7 | 2235025020120334 |
oct | 243121366560662 |
9 | 43625607113417 |
10 | 11212211020210 |
11 | 3633087901352 |
12 | 131100295012a |
13 | 6343cb520075 |
14 | 2aa9612c5454 |
15 | 1469c6b838aa |
hex | a328bdae1b2 |
11212211020210 has 8 divisors (see below), whose sum is σ = 20181979836396. Its totient is φ = 4484884408080.
The previous prime is 11212211020201. The next prime is 11212211020211. The reversal of 11212211020210 is 1202011221211.
11212211020210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9918903026041 + 1293307994169 = 3149429^2 + 1137237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (11212211020211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560610551001 + ... + 560610551020.
Almost surely, 211212211020210 is an apocalyptic number.
11212211020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11212211020210 is a deficient number, since it is larger than the sum of its proper divisors (8969768816186).
11212211020210 is a wasteful number, since it uses less digits than its factorization.
11212211020210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1121221102028.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11212211020210 its reverse (1202011221211), we get a palindrome (12414222241421).
The spelling of 11212211020210 in words is "eleven trillion, two hundred twelve billion, two hundred eleven million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •