Base | Representation |
---|---|
bin | 1100000100000110… |
… | …0111000100101011 |
3 | 22100200200000210001 |
4 | 3001001213010223 |
5 | 23113014044000 |
6 | 1253202403431 |
7 | 143152104640 |
oct | 30101470453 |
9 | 8320600701 |
10 | 3238424875 |
11 | 14120085a4 |
12 | 764660577 |
13 | 3c7c0344a |
14 | 22a14bdc7 |
15 | 13e48d46a |
hex | c106712b |
3238424875 has 32 divisors (see below), whose sum is σ = 4637213568. Its totient is φ = 2211840000.
The previous prime is 3238424873. The next prime is 3238424881. The reversal of 3238424875 is 5784248323.
It is not a de Polignac number, because 3238424875 - 21 = 3238424873 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3238424873) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 217675 + ... + 232075.
It is an arithmetic number, because the mean of its divisors is an integer number (144912924).
Almost surely, 23238424875 is an apocalyptic number.
3238424875 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3238424875 is a deficient number, since it is larger than the sum of its proper divisors (1398788693).
3238424875 is a wasteful number, since it uses less digits than its factorization.
3238424875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14680 (or 14670 counting only the distinct ones).
The product of its digits is 1290240, while the sum is 46.
The square root of 3238424875 is about 56907.1601382462. The cubic root of 3238424875 is about 1479.4874160821.
The spelling of 3238424875 in words is "three billion, two hundred thirty-eight million, four hundred twenty-four thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •