Base | Representation |
---|---|
bin | 10011001001010100… |
… | …111111100001001001 |
3 | 1222001200201220120100 |
4 | 103021110333201021 |
5 | 314100220431044 |
6 | 13235524320013 |
7 | 1325302440306 |
oct | 231124774111 |
9 | 58050656510 |
10 | 20557592649 |
11 | 879a2526a0 |
12 | 3b98843009 |
13 | 1c28076009 |
14 | dd03900ad |
15 | 804bad869 |
hex | 4c953f849 |
20557592649 has 12 divisors (see below), whose sum is σ = 32393782512. Its totient is φ = 12459147000.
The previous prime is 20557592599. The next prime is 20557592651. The reversal of 20557592649 is 94629575502.
20557592649 is a `hidden beast` number, since 2 + 0 + 5 + 5 + 7 + 592 + 6 + 49 = 666.
It is not a de Polignac number, because 20557592649 - 212 = 20557588553 is a prime.
It is a super-2 number, since 2×205575926492 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20557592595 and 20557592604.
It is not an unprimeable number, because it can be changed into a prime (20557592149) 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 11 ways as a sum of consecutive naturals, for example, 103826127 + ... + 103826324.
It is an arithmetic number, because the mean of its divisors is an integer number (2699481876).
Almost surely, 220557592649 is an apocalyptic number.
It is an amenable number.
20557592649 is a deficient number, since it is larger than the sum of its proper divisors (11836189863).
20557592649 is a wasteful number, since it uses less digits than its factorization.
20557592649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207652468 (or 207652465 counting only the distinct ones).
The product of its (nonzero) digits is 6804000, while the sum is 54.
The spelling of 20557592649 in words is "twenty billion, five hundred fifty-seven million, five hundred ninety-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •