Base | Representation |
---|---|
bin | 1100000100111101… |
… | …0011011000010110 |
3 | 22100221102101110010 |
4 | 3001033103120112 |
5 | 23114423423410 |
6 | 1253411341050 |
7 | 143224444350 |
oct | 30117233026 |
9 | 8327371403 |
10 | 3242014230 |
11 | 141403a304 |
12 | 7658b1786 |
13 | 3c888c120 |
14 | 22a8040d0 |
15 | 13e94bc20 |
hex | c13d3616 |
3242014230 has 64 divisors (see below), whose sum is σ = 9576419328. Its totient is φ = 684028800.
The previous prime is 3242014201. The next prime is 3242014231. The reversal of 3242014230 is 324102423.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3242014197 and 3242014206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3242014231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 591046 + ... + 596505.
It is an arithmetic number, because the mean of its divisors is an integer number (149631552).
Almost surely, 23242014230 is an apocalyptic number.
3242014230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3242014230 is an abundant number, since it is smaller than the sum of its proper divisors (6334405098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3242014230 is a wasteful number, since it uses less digits than its factorization.
3242014230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1187581.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 3242014230 is about 56938.6883410568. The cubic root of 3242014230 is about 1480.0338180123.
Adding to 3242014230 its reverse (324102423), we get a palindrome (3566116653).
The spelling of 3242014230 in words is "three billion, two hundred forty-two million, fourteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •