Base | Representation |
---|---|
bin | 110000001101000001100000… |
… | …110100111001101110001011 |
3 | 1000210122010011211221021001022 |
4 | 300031001200310321232023 |
5 | 210241411434303224321 |
6 | 2030520002250343055 |
7 | 62440403423054561 |
oct | 6015014064715613 |
9 | 1023563154837038 |
10 | 212001210211211 |
11 | 61606232338803 |
12 | 1b93b30842aa8b |
13 | 913a822609975 |
14 | 3a4ccb022da31 |
15 | 1979988365dab |
hex | c0d060d39b8b |
212001210211211 has 8 divisors (see below), whose sum is σ = 223162876256400. Its totient is φ = 200839914927360.
The previous prime is 212001210211199. The next prime is 212001210211229. The reversal of 212001210211211 is 112112012100212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212001210211211 - 210 = 212001210210187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212001210211211.
It is not an unprimeable number, because it can be changed into a prime (212001210201211) 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, 91516250 + ... + 93804191.
It is an arithmetic number, because the mean of its divisors is an integer number (27895359532050).
Almost surely, 2212001210211211 is an apocalyptic number.
212001210211211 is a deficient number, since it is larger than the sum of its proper divisors (11161666045189).
212001210211211 is a wasteful number, since it uses less digits than its factorization.
212001210211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185380669.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 212001210211211 its reverse (112112012100212), we get a palindrome (324113222311423).
The spelling of 212001210211211 in words is "two hundred twelve trillion, one billion, two hundred ten million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •