Base | Representation |
---|---|
bin | 1100000100111111… |
… | …0000010010000101 |
3 | 22100221122101211200 |
4 | 3001033300102011 |
5 | 23114441220423 |
6 | 1253414053113 |
7 | 143225446446 |
oct | 30117602205 |
9 | 8327571750 |
10 | 3242132613 |
11 | 1414110245 |
12 | 76594a199 |
13 | 3c8900c85 |
14 | 22a8352cd |
15 | 13e971d43 |
hex | c13f0485 |
3242132613 has 48 divisors (see below), whose sum is σ = 4932974592. Its totient is φ = 2049300000.
The previous prime is 3242132609. The next prime is 3242132651. The reversal of 3242132613 is 3162312423.
3242132613 is a `hidden beast` number, since 3 + 2 + 42 + 1 + 3 + 2 + 613 = 666.
It is not a de Polignac number, because 3242132613 - 22 = 3242132609 is a prime.
It is a super-2 number, since 2×32421326132 = 21022847760556415538, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3242132603) 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 47 ways as a sum of consecutive naturals, for example, 4691598 + ... + 4692288.
It is an arithmetic number, because the mean of its divisors is an integer number (102770304).
Almost surely, 23242132613 is an apocalyptic number.
It is an amenable number.
3242132613 is a deficient number, since it is larger than the sum of its proper divisors (1690841979).
3242132613 is a wasteful number, since it uses less digits than its factorization.
3242132613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1046 (or 1043 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
The square root of 3242132613 is about 56939.7278971370. The cubic root of 3242132613 is about 1480.0518324007.
The spelling of 3242132613 in words is "three billion, two hundred forty-two million, one hundred thirty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •