Base | Representation |
---|---|
bin | 1001110111011110… |
… | …0111110100100100 |
3 | 20211120211000120020 |
4 | 2131313213310210 |
5 | 20411020311230 |
6 | 1114452435140 |
7 | 122430522243 |
oct | 23567476444 |
9 | 6746730506 |
10 | 2648603940 |
11 | 113a082384 |
12 | 61b018ab0 |
13 | 33295ca88 |
14 | 1b1a9495a |
15 | 1077d1810 |
hex | 9dde7d24 |
2648603940 has 48 divisors (see below), whose sum is σ = 7419306048. Its totient is φ = 705988224.
The previous prime is 2648603887. The next prime is 2648603941. The reversal of 2648603940 is 493068462.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2648603892 and 2648603901.
It is not an unprimeable number, because it can be changed into a prime (2648603941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 152754 + ... + 169206.
It is an arithmetic number, because the mean of its divisors is an integer number (154568876).
Almost surely, 22648603940 is an apocalyptic number.
2648603940 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2648603940 is an abundant number, since it is smaller than the sum of its proper divisors (4770702108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2648603940 is a wasteful number, since it uses less digits than its factorization.
2648603940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19148 (or 19146 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 42.
The square root of 2648603940 is about 51464.5891851864. The cubic root of 2648603940 is about 1383.5844538864.
The spelling of 2648603940 in words is "two billion, six hundred forty-eight million, six hundred three thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •