Base | Representation |
---|---|
bin | 101111110001100010000011… |
… | …001100011111011101100011 |
3 | 1000112221111210121220022002120 |
4 | 233301202003030133131203 |
5 | 210014433334302211321 |
6 | 2022512042033115323 |
7 | 62154043155364512 |
oct | 5761420314373543 |
9 | 1015844717808076 |
10 | 210112001210211 |
11 | 60a47aaa090311 |
12 | 1b6951440b8b43 |
13 | 90316273c3449 |
14 | 39c5691a28679 |
15 | 1945766b2aec6 |
hex | bf188331f763 |
210112001210211 has 8 divisors (see below), whose sum is σ = 280154184317520. Its totient is φ = 140072242788192.
The previous prime is 210112001210183. The next prime is 210112001210249. The reversal of 210112001210211 is 112012100211012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210112001210211 - 25 = 210112001210179 is a prime.
It is a super-2 number, since 2×2101120012102112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210112001210011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 605969116 + ... + 606315753.
It is an arithmetic number, because the mean of its divisors is an integer number (35019273039690).
Almost surely, 2210112001210211 is an apocalyptic number.
210112001210211 is a deficient number, since it is larger than the sum of its proper divisors (70042183107309).
210112001210211 is a wasteful number, since it uses less digits than its factorization.
210112001210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1212342645.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 210112001210211 its reverse (112012100211012), we get a palindrome (322124101421223).
The spelling of 210112001210211 in words is "two hundred ten trillion, one hundred twelve billion, one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •