Base | Representation |
---|---|
bin | 111101010010101… |
… | …1011011110110000 |
3 | 12022022220202001110 |
4 | 1322211123132300 |
5 | 13202444212430 |
6 | 540024433320 |
7 | 101652041235 |
oct | 17245333660 |
9 | 5268822043 |
10 | 2056632240 |
11 | 965a08273 |
12 | 494918840 |
13 | 26a115470 |
14 | 1571db78c |
15 | c084c7b0 |
hex | 7a95b7b0 |
2056632240 has 80 divisors (see below), whose sum is σ = 6865998048. Its totient is φ = 506247168.
The previous prime is 2056632211. The next prime is 2056632247. The reversal of 2056632240 is 422366502.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 2056632198 and 2056632207.
It is not an unprimeable number, because it can be changed into a prime (2056632247) 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, 326469 + ... + 332708.
Almost surely, 22056632240 is an apocalyptic number.
2056632240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2056632240 is an abundant number, since it is smaller than the sum of its proper divisors (4809365808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2056632240 is a wasteful number, since it uses less digits than its factorization.
2056632240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 659206 (or 659200 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 2056632240 is about 45350.1073868629. The cubic root of 2056632240 is about 1271.7025628661.
Adding to 2056632240 its reverse (422366502), we get a palindrome (2478998742).
The spelling of 2056632240 in words is "two billion, fifty-six million, six hundred thirty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •