Base | Representation |
---|---|
bin | 111110101001101… |
… | …0000011110100110 |
3 | 12102111122211120210 |
4 | 1331103100132212 |
5 | 13301130401410 |
6 | 544333240250 |
7 | 103044256434 |
oct | 17523203646 |
9 | 5374584523 |
10 | 2102200230 |
11 | 989701169 |
12 | 4a8033086 |
13 | 2766ab480 |
14 | 15d29dd54 |
15 | c484e220 |
hex | 7d4d07a6 |
2102200230 has 128 divisors (see below), whose sum is σ = 5716085760. Its totient is φ = 490913280.
The previous prime is 2102200213. The next prime is 2102200231. The reversal of 2102200230 is 320022012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102200231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1174176 + ... + 1175964.
It is an arithmetic number, because the mean of its divisors is an integer number (44656920).
Almost surely, 22102200230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2102200230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2858042880).
2102200230 is an abundant number, since it is smaller than the sum of its proper divisors (3613885530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102200230 is a wasteful number, since it uses less digits than its factorization.
2102200230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1966.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2102200230 is about 45849.7571422140. The cubic root of 2102200230 is about 1281.0262420117.
Adding to 2102200230 its reverse (320022012), we get a palindrome (2422222242).
The spelling of 2102200230 in words is "two billion, one hundred two million, two hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •