Base | Representation |
---|---|
bin | 100101010110001011000… |
… | …010110100001001111011 |
3 | 100002100101210112010121010 |
4 | 211112023002310021323 |
5 | 314022021112343101 |
6 | 5243000104045003 |
7 | 353263325106123 |
oct | 45261302641173 |
9 | 10070353463533 |
10 | 2566428246651 |
11 | 8aa463925185 |
12 | 355483763763 |
13 | 158022b59569 |
14 | 8c3041adc83 |
15 | 46b5a88e2d6 |
hex | 2558b0b427b |
2566428246651 has 16 divisors (see below), whose sum is σ = 3426901237760. Its totient is φ = 1708454760480.
The previous prime is 2566428246643. The next prime is 2566428246659. The reversal of 2566428246651 is 1566428246652.
It is an interprime number because it is at equal distance from previous prime (2566428246643) and next prime (2566428246659).
It is not a de Polignac number, because 2566428246651 - 23 = 2566428246643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2566428246591 and 2566428246600.
It is not an unprimeable number, because it can be changed into a prime (2566428246659) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9826566 + ... + 10084356.
It is an arithmetic number, because the mean of its divisors is an integer number (214181327360).
Almost surely, 22566428246651 is an apocalyptic number.
2566428246651 is a deficient number, since it is larger than the sum of its proper divisors (860472991109).
2566428246651 is a wasteful number, since it uses less digits than its factorization.
2566428246651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262626.
The product of its digits is 33177600, while the sum is 57.
Subtracting from 2566428246651 its reverse (1566428246652), we obtain a palindrome (999999999999).
The spelling of 2566428246651 in words is "two trillion, five hundred sixty-six billion, four hundred twenty-eight million, two hundred forty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •