Base | Representation |
---|---|
bin | 111110111110001… |
… | …1101111011011110 |
3 | 12110020222200111220 |
4 | 1331330131323132 |
5 | 13311412100410 |
6 | 545400554210 |
7 | 103235142162 |
oct | 17574357336 |
9 | 5406880456 |
10 | 2113003230 |
11 | 99480a668 |
12 | 4ab782966 |
13 | 2789c1690 |
14 | 1608b2ca2 |
15 | c5785070 |
hex | 7df1dede |
2113003230 has 128 divisors (see below), whose sum is σ = 5629865472. Its totient is φ = 504258048.
The previous prime is 2113003229. The next prime is 2113003241. The reversal of 2113003230 is 323003112.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2733124 + ... + 2733896.
It is an arithmetic number, because the mean of its divisors is an integer number (43983324).
Almost surely, 22113003230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2113003230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2814932736).
2113003230 is an abundant number, since it is smaller than the sum of its proper divisors (3516862242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2113003230 is a wasteful number, since it uses less digits than its factorization.
2113003230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 2113003230 is about 45967.4148718416. The cubic root of 2113003230 is about 1283.2168497562.
Adding to 2113003230 its reverse (323003112), we get a palindrome (2436006342).
The spelling of 2113003230 in words is "two billion, one hundred thirteen million, three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •