Base | Representation |
---|---|
bin | 101110100110010011011… |
… | …011101000011111110000 |
3 | 102100010111111122110202220 |
4 | 232212103123220133300 |
5 | 404431123334130112 |
6 | 10451025332241040 |
7 | 450232046000154 |
oct | 56462333503760 |
9 | 12303444573686 |
10 | 3202224130032 |
11 | 1025068048774 |
12 | 438742470180 |
13 | 1a2c7887b945 |
14 | b0dba537064 |
15 | 5846d09e98c |
hex | 2e9936e87f0 |
3202224130032 has 40 divisors (see below), whose sum is σ = 8759024828496. Its totient is φ = 1004619334656.
The previous prime is 3202224130003. The next prime is 3202224130037. The reversal of 3202224130032 is 2300314222023.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 3202224129984 and 3202224130011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3202224130037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1962146323 + ... + 1962147954.
Almost surely, 23202224130032 is an apocalyptic number.
It is an amenable number.
3202224130032 is an abundant number, since it is smaller than the sum of its proper divisors (5556800698464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3202224130032 is a wasteful number, since it uses less digits than its factorization.
3202224130032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3924294305 (or 3924294299 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 3202224130032 its reverse (2300314222023), we get a palindrome (5502538352055).
The spelling of 3202224130032 in words is "three trillion, two hundred two billion, two hundred twenty-four million, one hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •