Base | Representation |
---|---|
bin | 1100000101001100… |
… | …0100000101000011 |
3 | 22101000021110211222 |
4 | 3001103010011003 |
5 | 23120202001011 |
6 | 1253444425255 |
7 | 143236021610 |
oct | 30123040503 |
9 | 8330243758 |
10 | 3243000131 |
11 | 1414652aa8 |
12 | 7660a822b |
13 | 3c8b45ab7 |
14 | 22a9bd507 |
15 | 13ea93ddb |
hex | c14c4143 |
3243000131 has 8 divisors (see below), whose sum is σ = 3708563040. Its totient is φ = 2778006528.
The previous prime is 3243000119. The next prime is 3243000133. The reversal of 3243000131 is 1310003423.
It is a happy number.
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 3243000131 - 214 = 3242983747 is a prime.
It is a super-2 number, since 2×32430001312 = 21034099699332034322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3243000133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130046 + ... + 152963.
It is an arithmetic number, because the mean of its divisors is an integer number (463570380).
Almost surely, 23243000131 is an apocalyptic number.
3243000131 is a deficient number, since it is larger than the sum of its proper divisors (465562909).
3243000131 is a wasteful number, since it uses less digits than its factorization.
3243000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284653.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3243000131 is about 56947.3452498007. The cubic root of 3243000131 is about 1480.1838295823.
Adding to 3243000131 its reverse (1310003423), we get a palindrome (4553003554).
The spelling of 3243000131 in words is "three billion, two hundred forty-three million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •