Base | Representation |
---|---|
bin | 1111101001101000… |
… | …1010011000111100 |
3 | 101211210020011020201 |
4 | 3322122022120330 |
5 | 32100444143200 |
6 | 1532513253244 |
7 | 206052201406 |
oct | 37232123074 |
9 | 11753204221 |
10 | 4201162300 |
11 | 18664a0465 |
12 | 992b64224 |
13 | 51c4c4a6a |
14 | 2bbd59b76 |
15 | 198c5dc6a |
hex | fa68a63c |
4201162300 has 72 divisors (see below), whose sum is σ = 9270156672. Its totient is φ = 1652280000.
The previous prime is 4201162283. The next prime is 4201162331. The reversal of 4201162300 is 32611024.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 3996775 + ... + 3997825.
It is an arithmetic number, because the mean of its divisors is an integer number (128752176).
Almost surely, 24201162300 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 4201162300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4635078336).
4201162300 is an abundant number, since it is smaller than the sum of its proper divisors (5068994372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4201162300 is a wasteful number, since it uses less digits than its factorization.
4201162300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1699 (or 1692 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 4201162300 is about 64816.3737029464. The cubic root of 4201162300 is about 1613.5774646876.
Adding to 4201162300 its reverse (32611024), we get a palindrome (4233773324).
The spelling of 4201162300 in words is "four billion, two hundred one million, one hundred sixty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •