Base | Representation |
---|---|
bin | 100000011101000010010… |
… | …001111010110010100010 |
3 | 21220012112110210111212120 |
4 | 200131002101322302202 |
5 | 243014422201121010 |
6 | 4424312330205110 |
7 | 320061302251005 |
oct | 40350221726242 |
9 | 7805473714776 |
10 | 2230200020130 |
11 | 78a905852105 |
12 | 300289583796 |
13 | 1323cb50bb34 |
14 | 79d297a553c |
15 | 3d02c8dae70 |
hex | 2074247aca2 |
2230200020130 has 128 divisors (see below), whose sum is σ = 5595982848000. Its totient is φ = 568130863104.
The previous prime is 2230200020089. The next prime is 2230200020149. The reversal of 2230200020130 is 310200020322.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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, 33281439 + ... + 33348381.
It is an arithmetic number, because the mean of its divisors is an integer number (43718616000).
Almost surely, 22230200020130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2230200020130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2797991424000).
2230200020130 is an abundant number, since it is smaller than the sum of its proper divisors (3365782827870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2230200020130 is a wasteful number, since it uses less digits than its factorization.
2230200020130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67388.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2230200020130 its reverse (310200020322), we get a palindrome (2540400040452).
The spelling of 2230200020130 in words is "two trillion, two hundred thirty billion, two hundred million, twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •