Base | Representation |
---|---|
bin | 1001100100010011… |
… | …1011111011001100 |
3 | 20121222112111011122 |
4 | 2121010323323030 |
5 | 20224430124301 |
6 | 1102501340112 |
7 | 120433260050 |
oct | 23104737314 |
9 | 6558474148 |
10 | 2568208076 |
11 | 10a8760815 |
12 | 5b8107638 |
13 | 31c0c1465 |
14 | 1a5127c60 |
15 | 10070081b |
hex | 9913becc |
2568208076 has 24 divisors (see below), whose sum is σ = 5139353856. Its totient is φ = 1100031120.
The previous prime is 2568208057. The next prime is 2568208079. The reversal of 2568208076 is 6708028652.
It is a super-3 number, since 3×25682080763 (a number of 29 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (2568208079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25385 + ... + 76031.
It is an arithmetic number, because the mean of its divisors is an integer number (214139744).
Almost surely, 22568208076 is an apocalyptic number.
It is an amenable number.
2568208076 is an abundant number, since it is smaller than the sum of its proper divisors (2571145780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2568208076 is a wasteful number, since it uses less digits than its factorization.
2568208076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52469 (or 52467 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 44.
The square root of 2568208076 is about 50677.4908218629. The cubic root of 2568208076 is about 1369.4412405176.
The spelling of 2568208076 in words is "two billion, five hundred sixty-eight million, two hundred eight thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •