Base | Representation |
---|---|
bin | 1001100100010000… |
… | …1011110101111010 |
3 | 20121222011111000100 |
4 | 2121010023311322 |
5 | 20224402324010 |
6 | 1102453220230 |
7 | 120431506626 |
oct | 23104136572 |
9 | 6558144010 |
10 | 2568011130 |
11 | 10a8636853 |
12 | 5b8031676 |
13 | 31c052919 |
14 | 1a50b6186 |
15 | 1006b22c0 |
hex | 9910bd7a |
2568011130 has 48 divisors (see below), whose sum is σ = 6761364480. Its totient is φ = 676132704.
The previous prime is 2568011113. The next prime is 2568011137. The reversal of 2568011130 is 311108652.
2568011130 = 4012 + 4022 + ... + 19802.
2568011130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2568011094 and 2568011103.
It is not an unprimeable number, because it can be changed into a prime (2568011137) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 173482 + ... + 187701.
It is an arithmetic number, because the mean of its divisors is an integer number (140861760).
Almost surely, 22568011130 is an apocalyptic number.
2568011130 is an abundant number, since it is smaller than the sum of its proper divisors (4193353350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2568011130 is a wasteful number, since it uses less digits than its factorization.
2568011130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 361275 (or 361272 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 2568011130 is about 50675.5476536761. The cubic root of 2568011130 is about 1369.4062338955.
Adding to 2568011130 its reverse (311108652), we get a palindrome (2879119782).
The spelling of 2568011130 in words is "two billion, five hundred sixty-eight million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •