Base | Representation |
---|---|
bin | 11001000010111… |
… | …01111101000000 |
3 | 112122100012001200 |
4 | 30201131331000 |
5 | 412241200112 |
6 | 32503101200 |
7 | 5130551352 |
oct | 1441357500 |
9 | 478305050 |
10 | 210100032 |
11 | a866129a |
12 | 5a441800 |
13 | 346b255c |
14 | 1dc910d2 |
15 | 136a1cdc |
hex | c85df40 |
210100032 has 84 divisors (see below), whose sum is σ = 628436640. Its totient is φ = 66984192.
The previous prime is 210100013. The next prime is 210100057. The reversal of 210100032 is 230001012.
It is a happy number.
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 = 210099987 and 210100023.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5319 + ... + 21177.
Almost surely, 2210100032 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 210100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (314218320).
210100032 is an abundant number, since it is smaller than the sum of its proper divisors (418336608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210100032 is a wasteful number, since it uses less digits than its factorization.
210100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15900 (or 15887 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 210100032 is about 14494.8277671727. The cubic root of 210100032 is about 594.4865584537.
Adding to 210100032 its reverse (230001012), we get a palindrome (440101044).
The spelling of 210100032 in words is "two hundred ten million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •