Base | Representation |
---|---|
bin | 11001000010111… |
… | …10011011111100 |
3 | 112122100021210000 |
4 | 30201132123330 |
5 | 412241231022 |
6 | 32503114300 |
7 | 5130560211 |
oct | 1441363374 |
9 | 478307700 |
10 | 210102012 |
11 | a866282a |
12 | 5a442990 |
13 | 346b3423 |
14 | 1dc91b08 |
15 | 136a26ac |
hex | c85e6fc |
210102012 has 60 divisors (see below), whose sum is σ = 550990440. Its totient is φ = 69812064.
The previous prime is 210101977. The next prime is 210102037. The reversal of 210102012 is 210201012.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 210101985 and 210102003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 125203 + ... + 126869.
It is an arithmetic number, because the mean of its divisors is an integer number (9183174).
Almost surely, 2210102012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 210102012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (275495220).
210102012 is an abundant number, since it is smaller than the sum of its proper divisors (340888428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210102012 is a wasteful number, since it uses less digits than its factorization.
210102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2072 (or 2061 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 210102012 is about 14494.8960672369. The cubic root of 210102012 is about 594.4884259446.
Adding to 210102012 its reverse (210201012), we get a palindrome (420303024).
The spelling of 210102012 in words is "two hundred ten million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •