Base | Representation |
---|---|
bin | 1100001111001011100… |
… | …0101111001110110100 |
3 | 202002122112012202112000 |
4 | 3003302320233032310 |
5 | 11421024221440004 |
6 | 240325131055300 |
7 | 21121531221201 |
oct | 3036270571664 |
9 | 662575182460 |
10 | 210233390004 |
11 | 811832a4610 |
12 | 348b28a1530 |
13 | 16a95484931 |
14 | a265238ca8 |
15 | 5706a84c39 |
hex | 30f2e2f3b4 |
210233390004 has 192 divisors, whose sum is σ = 602042112000. Its totient is φ = 62914579200.
The previous prime is 210233389999. The next prime is 210233390021. The reversal of 210233390004 is 400093332012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 210233390004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32385199 + ... + 32391689.
It is an arithmetic number, because the mean of its divisors is an integer number (3135636000).
Almost surely, 2210233390004 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 210233390004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (301021056000).
210233390004 is an abundant number, since it is smaller than the sum of its proper divisors (391808721996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210233390004 is a wasteful number, since it uses less digits than its factorization.
210233390004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6851 (or 6843 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
The spelling of 210233390004 in words is "two hundred ten billion, two hundred thirty-three million, three hundred ninety thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •