Base | Representation |
---|---|
bin | 100101001110001000010… |
… | …111111000010111001101 |
3 | 100001112010000201200122110 |
4 | 211032020113320113031 |
5 | 313401330114041134 |
6 | 5235011211334233 |
7 | 352536336022326 |
oct | 45161027702715 |
9 | 10045100650573 |
10 | 2557793502669 |
11 | 8a6832829229 |
12 | 353873a51379 |
13 | 157277c744b2 |
14 | 8bb254b744d |
15 | 468027b17e9 |
hex | 253885f85cd |
2557793502669 has 16 divisors (see below), whose sum is σ = 3433161636224. Its totient is φ = 1693811736000.
The previous prime is 2557793502643. The next prime is 2557793502697. The reversal of 2557793502669 is 9662053977552.
2557793502669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2557793502669 - 28 = 2557793502413 is a prime.
It is a super-3 number, since 3×25577935026693 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2557793502269) 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, 8854887 + ... + 9139179.
It is an arithmetic number, because the mean of its divisors is an integer number (214572602264).
Almost surely, 22557793502669 is an apocalyptic number.
It is an amenable number.
2557793502669 is a deficient number, since it is larger than the sum of its proper divisors (875368133555).
2557793502669 is a wasteful number, since it uses less digits than its factorization.
2557793502669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304308.
The product of its (nonzero) digits is 214326000, while the sum is 66.
The spelling of 2557793502669 in words is "two trillion, five hundred fifty-seven billion, seven hundred ninety-three million, five hundred two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •