Base | Representation |
---|---|
bin | 111101001011000… |
… | …000100110110000 |
3 | 2122112011020202212 |
4 | 331023000212300 |
5 | 4100212434430 |
6 | 245501031252 |
7 | 34301242214 |
oct | 7513004660 |
9 | 2575136685 |
10 | 1026296240 |
11 | 487354612 |
12 | 247855528 |
13 | 1348163a8 |
14 | 9a434944 |
15 | 60177b95 |
hex | 3d2c09b0 |
1026296240 has 60 divisors (see below), whose sum is σ = 2432542224. Its totient is φ = 402684672.
The previous prime is 1026296237. The next prime is 1026296279. The reversal of 1026296240 is 426926201.
It is a junction number, because it is equal to n+sod(n) for n = 1026296197 and 1026296206.
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 11 ways as a sum of consecutive naturals, for example, 222437 + ... + 227003.
Almost surely, 21026296240 is an apocalyptic number.
1026296240 is a gapful number since it is divisible by the number (10) 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 1026296240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1216271112).
1026296240 is an abundant number, since it is smaller than the sum of its proper divisors (1406245984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026296240 is an equidigital number, since it uses as much as digits as its factorization.
1026296240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4686 (or 4627 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 1026296240 is about 32035.8586586968. The cubic root of 1026296240 is about 1008.6896840041.
The spelling of 1026296240 in words is "one billion, twenty-six million, two hundred ninety-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •