Base | Representation |
---|---|
bin | 11001000010111… |
… | …10011011111011 |
3 | 112122100021202222 |
4 | 30201132123323 |
5 | 412241231021 |
6 | 32503114255 |
7 | 5130560210 |
oct | 1441363373 |
9 | 478307688 |
10 | 210102011 |
11 | a8662829 |
12 | 5a44298b |
13 | 346b3422 |
14 | 1dc91b07 |
15 | 136a26ab |
hex | c85e6fb |
210102011 has 8 divisors (see below), whose sum is σ = 241324800. Its totient is φ = 179181288.
The previous prime is 210101977. The next prime is 210102037. The reversal of 210102011 is 110201012.
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 210102011 - 210 = 210100987 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 210102011.
It is not an unprimeable number, because it can be changed into a prime (210102041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74021 + ... + 76806.
It is an arithmetic number, because the mean of its divisors is an integer number (30165600).
Almost surely, 2210102011 is an apocalyptic number.
210102011 is a deficient number, since it is larger than the sum of its proper divisors (31222789).
210102011 is a wasteful number, since it uses less digits than its factorization.
210102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151033.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 210102011 is about 14494.8960327420. The cubic root of 210102011 is about 594.4884250014.
Adding to 210102011 its reverse (110201012), we get a palindrome (320303023).
Subtracting from 210102011 its reverse (110201012), we obtain a palindrome (99900999).
The spelling of 210102011 in words is "two hundred ten million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •