Base | Representation |
---|---|
bin | 1001100011110100… |
… | …0100101111111100 |
3 | 20121211122210000000 |
4 | 2120331010233330 |
5 | 20223413201233 |
6 | 1102345234300 |
7 | 120406614222 |
oct | 23075045774 |
9 | 6554583000 |
10 | 2566147068 |
11 | 10a7583301 |
12 | 5b7492990 |
13 | 31b84c324 |
14 | 1a4b4cb12 |
15 | 100444d13 |
hex | 98f44bfc |
2566147068 has 96 divisors (see below), whose sum is σ = 7090048000. Its totient is φ = 810309744.
The previous prime is 2566147061. The next prime is 2566147069. The reversal of 2566147068 is 8607416652.
2566147068 is a `hidden beast` number, since 2 + 566 + 14 + 70 + 6 + 8 = 666.
It is a super-2 number, since 2×25661470682 = 13170221549209993248, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2566147061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 158493 + ... + 173931.
Almost surely, 22566147068 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2566147068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3545024000).
2566147068 is an abundant number, since it is smaller than the sum of its proper divisors (4523900932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2566147068 is a wasteful number, since it uses less digits than its factorization.
2566147068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15483 (or 15463 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The square root of 2566147068 is about 50657.1521899919. The cubic root of 2566147068 is about 1369.0748132120.
The spelling of 2566147068 in words is "two billion, five hundred sixty-six million, one hundred forty-seven thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •