Base | Representation |
---|---|
bin | 111011100110101… |
… | …1001110010110110 |
3 | 12011101100122021200 |
4 | 1313031121302312 |
5 | 13044000032410 |
6 | 530242553330 |
7 | 100363511202 |
oct | 16715316266 |
9 | 5141318250 |
10 | 2000002230 |
11 | 936a49306 |
12 | 479968846 |
13 | 25b478395 |
14 | 14d899b02 |
15 | ba8b33c0 |
hex | 77359cb6 |
2000002230 has 96 divisors (see below), whose sum is σ = 5519404800. Its totient is φ = 500729856.
The previous prime is 2000002217. The next prime is 2000002259. The reversal of 2000002230 is 322000002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 731506 + ... + 734234.
It is an arithmetic number, because the mean of its divisors is an integer number (57493800).
Almost surely, 22000002230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000002230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2759702400).
2000002230 is an abundant number, since it is smaller than the sum of its proper divisors (3519402570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000002230 is a wasteful number, since it uses less digits than its factorization.
2000002230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3238 (or 3235 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 9.
The square root of 2000002230 is about 44721.3844821468. The cubic root of 2000002230 is about 1259.9215181654.
Adding to 2000002230 its reverse (322000002), we get a palindrome (2322002232).
The spelling of 2000002230 in words is "two billion, two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •