Base | Representation |
---|---|
bin | 1100000101000000… |
… | …0001010100100000 |
3 | 22100221202221120101 |
4 | 3001100001110200 |
5 | 23120000434100 |
6 | 1253415352144 |
7 | 143226160063 |
oct | 30120012440 |
9 | 8327687511 |
10 | 3242202400 |
11 | 1414158718 |
12 | 765982654 |
13 | 3c8926978 |
14 | 22a8528da |
15 | 13e98786a |
hex | c1401520 |
3242202400 has 72 divisors (see below), whose sum is σ = 7925938020. Its totient is φ = 1295093760.
The previous prime is 3242202377. The next prime is 3242202409. The reversal of 3242202400 is 42022423.
It can be written as a sum of positive squares in 6 ways, for example, as 969201424 + 2273000976 = 31132^2 + 47676^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3242202409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 683236 + ... + 687964.
Almost surely, 23242202400 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 3242202400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3962969010).
3242202400 is an abundant number, since it is smaller than the sum of its proper divisors (4683735620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3242202400 is a wasteful number, since it uses less digits than its factorization.
3242202400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5606 (or 5593 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 19.
The square root of 3242202400 is about 56940.3407084995. The cubic root of 3242202400 is about 1480.0624517109.
Adding to 3242202400 its reverse (42022423), we get a palindrome (3284224823).
The spelling of 3242202400 in words is "three billion, two hundred forty-two million, two hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •