Base | Representation |
---|---|
bin | 100110011101011… |
… | …0111000000000000 |
3 | 10022221022002112000 |
4 | 1030322313000000 |
5 | 10120331414143 |
6 | 332015504000 |
7 | 43660023660 |
oct | 11472670000 |
9 | 3287262460 |
10 | 1290498048 |
11 | 6024a8314 |
12 | 300228000 |
13 | 17748c018 |
14 | c356a1a0 |
15 | 78464bd3 |
hex | 4ceb7000 |
1290498048 has 208 divisors, whose sum is σ = 4372028160. Its totient is φ = 368492544.
The previous prime is 1290498043. The next prime is 1290498049. The reversal of 1290498048 is 8408940921.
It is a junction number, because it is equal to n+sod(n) for n = 1290497994 and 1290498012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1290498043) 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, 773311 + ... + 774977.
Almost surely, 21290498048 is an apocalyptic number.
1290498048 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1290498048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2186014080).
1290498048 is an abundant number, since it is smaller than the sum of its proper divisors (3081530112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1290498048 is an equidigital number, since it uses as much as digits as its factorization.
1290498048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1707 (or 1679 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The square root of 1290498048 is about 35923.5027245395. The cubic root of 1290498048 is about 1088.7273106972.
The spelling of 1290498048 in words is "one billion, two hundred ninety million, four hundred ninety-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •