Base | Representation |
---|---|
bin | 1100000101000011… |
… | …0001001111001100 |
3 | 22100222010220210120 |
4 | 3001100301033030 |
5 | 23120023224133 |
6 | 1253423504540 |
7 | 143230635225 |
oct | 30120611714 |
9 | 8328126716 |
10 | 3242398668 |
11 | 1414282123 |
12 | 765a58150 |
13 | 3c89950c2 |
14 | 22a8a424c |
15 | 13e9c5ab3 |
hex | c14313cc |
3242398668 has 12 divisors (see below), whose sum is σ = 7565596920. Its totient is φ = 1080799552.
The previous prime is 3242398667. The next prime is 3242398759. The reversal of 3242398668 is 8668932423.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 3242398668.
It is not an unprimeable number, because it can be changed into a prime (3242398667) 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 3 ways as a sum of consecutive naturals, for example, 135099933 + ... + 135099956.
It is an arithmetic number, because the mean of its divisors is an integer number (630466410).
Almost surely, 23242398668 is an apocalyptic number.
It is an amenable number.
3242398668 is an abundant number, since it is smaller than the sum of its proper divisors (4323198252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3242398668 is a wasteful number, since it uses less digits than its factorization.
3242398668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270199896 (or 270199894 counting only the distinct ones).
The product of its digits is 2985984, while the sum is 51.
The square root of 3242398668 is about 56942.0641353999. The cubic root of 3242398668 is about 1480.0923164962.
The spelling of 3242398668 in words is "three billion, two hundred forty-two million, three hundred ninety-eight thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •