Base | Representation |
---|---|
bin | 1001110101000000… |
… | …0110011001110000 |
3 | 20210212022122122000 |
4 | 2131100012121300 |
5 | 20400342242230 |
6 | 1113442414000 |
7 | 122243461560 |
oct | 23520063160 |
9 | 6725278560 |
10 | 2638243440 |
11 | 1134246388 |
12 | 617661300 |
13 | 3307730c1 |
14 | 1b0558da0 |
15 | 106936b60 |
hex | 9d406670 |
2638243440 has 160 divisors (see below), whose sum is σ = 10385525760. Its totient is φ = 603023616.
The previous prime is 2638243411. The next prime is 2638243459. The reversal of 2638243440 is 443428362.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2638243395 and 2638243404.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 72124 + ... + 102363.
It is an arithmetic number, because the mean of its divisors is an integer number (64909536).
Almost surely, 22638243440 is an apocalyptic number.
2638243440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2638243440 is an abundant number, since it is smaller than the sum of its proper divisors (7747282320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2638243440 is a wasteful number, since it uses less digits than its factorization.
2638243440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174516 (or 174504 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 36.
The square root of 2638243440 is about 51363.8339690487. The cubic root of 2638243440 is about 1381.7780483706.
The spelling of 2638243440 in words is "two billion, six hundred thirty-eight million, two hundred forty-three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •