Base | Representation |
---|---|
bin | 11001000010010… |
… | …11001001011000 |
3 | 112122012021101122 |
4 | 30201023021120 |
5 | 412231214000 |
6 | 32501304412 |
7 | 5130110645 |
oct | 1441131130 |
9 | 478167348 |
10 | 210023000 |
11 | a8609430 |
12 | 5a405108 |
13 | 34686485 |
14 | 1dc70dcc |
15 | 13689085 |
hex | c84b258 |
210023000 has 128 divisors (see below), whose sum is σ = 546661440. Its totient is φ = 74880000.
The previous prime is 210022993. The next prime is 210023039. The reversal of 210023000 is 320012.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 670844 + ... + 671156.
Almost surely, 2210023000 is an apocalyptic number.
210023000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 210023000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (273330720).
210023000 is an abundant number, since it is smaller than the sum of its proper divisors (336638440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210023000 is a wasteful number, since it uses less digits than its factorization.
210023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406 (or 392 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 8.
The square root of 210023000 is about 14492.1702998550. The cubic root of 210023000 is about 594.4138945167.
Adding to 210023000 its reverse (320012), we get a palindrome (210343012).
The spelling of 210023000 in words is "two hundred ten million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •