Base | Representation |
---|---|
bin | 11011111110000011… |
… | …000000000010100000 |
3 | 2212111222111211120000 |
4 | 123332003000002200 |
5 | 443001143100412 |
6 | 21444014020000 |
7 | 2112135546510 |
oct | 337603000240 |
9 | 85458454500 |
10 | 30032003232 |
11 | 11811312590 |
12 | 59a17a7600 |
13 | 2aa7bbbb1a |
14 | 164c7b9840 |
15 | bab84b4dc |
hex | 6fe0c00a0 |
30032003232 has 240 divisors, whose sum is σ = 110118076992. Its totient is φ = 7800468480.
The previous prime is 30032003213. The next prime is 30032003291. The reversal of 30032003232 is 23230023003.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 124348 + ... + 274820.
Almost surely, 230032003232 is an apocalyptic number.
30032003232 is a gapful number since it is divisible by the number (32) 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 30032003232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55059038496).
30032003232 is an abundant number, since it is smaller than the sum of its proper divisors (80086073760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30032003232 is a wasteful number, since it uses less digits than its factorization.
30032003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150513 (or 150496 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 18.
Adding to 30032003232 its reverse (23230023003), we get a palindrome (53262026235).
The spelling of 30032003232 in words is "thirty billion, thirty-two million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •