Base | Representation |
---|---|
bin | 1100000101010010… |
… | …1010100111100011 |
3 | 22101001001210222112 |
4 | 3001110222213203 |
5 | 23120303421011 |
6 | 1253501425535 |
7 | 143242421240 |
oct | 30124524743 |
9 | 8331053875 |
10 | 3243420131 |
11 | 141490a606 |
12 | 76626b2ab |
13 | 3c8c62013 |
14 | 22aa8c5c7 |
15 | 13eb2858b |
hex | c152a9e3 |
3243420131 has 8 divisors (see below), whose sum is σ = 3709989984. Its totient is φ = 2777656320.
The previous prime is 3243420121. The next prime is 3243420143. The reversal of 3243420131 is 1310243423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3243420131 - 222 = 3239225827 is a prime.
It is a super-2 number, since 2×32434201312 = 21039548292352114322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3243420097 and 3243420106.
It is not an unprimeable number, because it can be changed into a prime (3243420121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192860 + ... + 209001.
It is an arithmetic number, because the mean of its divisors is an integer number (463748748).
Almost surely, 23243420131 is an apocalyptic number.
3243420131 is a deficient number, since it is larger than the sum of its proper divisors (466569853).
3243420131 is a wasteful number, since it uses less digits than its factorization.
3243420131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403021.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 3243420131 is about 56951.0327474401. The cubic root of 3243420131 is about 1480.2477262159.
Adding to 3243420131 its reverse (1310243423), we get a palindrome (4553663554).
The spelling of 3243420131 in words is "three billion, two hundred forty-three million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •