Base | Representation |
---|---|
bin | 1100000100100110… |
… | …1001110010000101 |
3 | 22100211122010202101 |
4 | 3001021221302011 |
5 | 23114034030000 |
6 | 1253315512101 |
7 | 143206035304 |
oct | 30111516205 |
9 | 8324563671 |
10 | 3240533125 |
11 | 1413218555 |
12 | 7652b8631 |
13 | 3c8490c2b |
14 | 22a53a43b |
15 | 13e757e6a |
hex | c1269c85 |
3240533125 has 20 divisors (see below), whose sum is σ = 4262510560. Its totient is φ = 2455974000.
The previous prime is 3240533119. The next prime is 3240533129. The reversal of 3240533125 is 5213350423.
It is a de Polignac number, because none of the positive numbers 2k-3240533125 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3240533093 and 3240533102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3240533129) 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 19 ways as a sum of consecutive naturals, for example, 124569 + ... + 148318.
It is an arithmetic number, because the mean of its divisors is an integer number (213125528).
Almost surely, 23240533125 is an apocalyptic number.
It is an amenable number.
3240533125 is a deficient number, since it is larger than the sum of its proper divisors (1021977435).
3240533125 is an equidigital number, since it uses as much as digits as its factorization.
3240533125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272926 (or 272911 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 3240533125 is about 56925.6807161759. The cubic root of 3240533125 is about 1479.8084005985.
Adding to 3240533125 its reverse (5213350423), we get a palindrome (8453883548).
The spelling of 3240533125 in words is "three billion, two hundred forty million, five hundred thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •