Base | Representation |
---|---|
bin | 1011010010111100… |
… | …0101110101000000 |
3 | 21211022200221010120 |
4 | 2310233011311000 |
5 | 22202223243040 |
6 | 1220515300240 |
7 | 135066434055 |
oct | 26457056500 |
9 | 7738627116 |
10 | 3032243520 |
11 | 1316693489 |
12 | 7075aa680 |
13 | 394293747 |
14 | 20a9db02c |
15 | 12b3127d0 |
hex | b4bc5d40 |
3032243520 has 112 divisors (see below), whose sum is σ = 9643993920. Its totient is φ = 807202816.
The previous prime is 3032243477. The next prime is 3032243561. The reversal of 3032243520 is 253422303.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 630244 + ... + 635036.
Almost surely, 23032243520 is an apocalyptic number.
3032243520 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3032243520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4821996960).
3032243520 is an abundant number, since it is smaller than the sum of its proper divisors (6611750400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3032243520 is a wasteful number, since it uses less digits than its factorization.
3032243520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5472 (or 5462 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 24.
The square root of 3032243520 is about 55065.8108085226. The cubic root of 3032243520 is about 1447.3981911506.
Adding to 3032243520 its reverse (253422303), we get a palindrome (3285665823).
The spelling of 3032243520 in words is "three billion, thirty-two million, two hundred forty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •