Base | Representation |
---|---|
bin | 1001100100010011… |
… | …1001010100000110 |
3 | 20121222111221111120 |
4 | 2121010321110012 |
5 | 20224424304012 |
6 | 1102501214410 |
7 | 120433213632 |
oct | 23104712406 |
9 | 6558457446 |
10 | 2568197382 |
11 | 10a8753783 |
12 | 5b8101406 |
13 | 31c0b962a |
14 | 1a5123dc2 |
15 | 1006ec58c |
hex | 99139506 |
2568197382 has 8 divisors (see below), whose sum is σ = 5136394776. Its totient is φ = 856065792.
The previous prime is 2568197381. The next prime is 2568197383. The reversal of 2568197382 is 2837918652.
It is an interprime number because it is at equal distance from previous prime (2568197381) and next prime (2568197383).
It is a sphenic number, since it is the product of 3 distinct primes.
2568197382 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2568197381) 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, 214016443 + ... + 214016454.
It is an arithmetic number, because the mean of its divisors is an integer number (642049347).
Almost surely, 22568197382 is an apocalyptic number.
2568197382 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2568197382 is a wasteful number, since it uses less digits than its factorization.
2568197382 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428032902.
The product of its digits is 1451520, while the sum is 51.
The square root of 2568197382 is about 50677.3853113990. The cubic root of 2568197382 is about 1369.4393397338.
The spelling of 2568197382 in words is "two billion, five hundred sixty-eight million, one hundred ninety-seven thousand, three hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •