Base | Representation |
---|---|
bin | 1001110111011001… |
… | …0000100010101000 |
3 | 20211120010212011111 |
4 | 2131312100202220 |
5 | 20410422341230 |
6 | 1114441040104 |
7 | 122424503050 |
oct | 23566204250 |
9 | 6746125144 |
10 | 2648246440 |
11 | 1139958824 |
12 | 61aa86034 |
13 | 332866138 |
14 | 1b1a00560 |
15 | 10776092a |
hex | 9dd908a8 |
2648246440 has 32 divisors (see below), whose sum is σ = 6809777280. Its totient is φ = 907970112.
The previous prime is 2648246423. The next prime is 2648246449. The reversal of 2648246440 is 446428462.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2648246393 and 2648246402.
It is not an unprimeable number, because it can be changed into a prime (2648246449) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4728732 + ... + 4729291.
It is an arithmetic number, because the mean of its divisors is an integer number (212805540).
Almost surely, 22648246440 is an apocalyptic number.
2648246440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2648246440 is an abundant number, since it is smaller than the sum of its proper divisors (4161530840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2648246440 is a wasteful number, since it uses less digits than its factorization.
2648246440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9458041 (or 9458037 counting only the distinct ones).
The product of its (nonzero) digits is 294912, while the sum is 40.
The square root of 2648246440 is about 51461.1158060142. The cubic root of 2648246440 is about 1383.5222004994.
The spelling of 2648246440 in words is "two billion, six hundred forty-eight million, two hundred forty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •