Base | Representation |
---|---|
bin | 100000000010100… |
… | …1101111001110010 |
3 | 2202221000012222000 |
4 | 1000011031321302 |
5 | 4200212000430 |
6 | 254403154430 |
7 | 35433165000 |
oct | 10005157162 |
9 | 2687005860 |
10 | 1075109490 |
11 | 501964744 |
12 | 260075a16 |
13 | 141977580 |
14 | a2adda70 |
15 | 645bae60 |
hex | 4014de72 |
1075109490 has 512 divisors, whose sum is σ = 3870720000. Its totient is φ = 210325248.
The previous prime is 1075109423. The next prime is 1075109501. The reversal of 1075109490 is 949015701.
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 255 ways as a sum of consecutive naturals, for example, 22874647 + ... + 22874693.
It is an arithmetic number, because the mean of its divisors is an integer number (7560000).
Almost surely, 21075109490 is an apocalyptic number.
1075109490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1075109490, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1935360000).
1075109490 is an abundant number, since it is smaller than the sum of its proper divisors (2795610510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1075109490 is a wasteful number, since it uses less digits than its factorization.
1075109490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116 (or 96 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 36.
The square root of 1075109490 is about 32788.8622858433. The cubic root of 1075109490 is about 1024.4345848490.
The spelling of 1075109490 in words is "one billion, seventy-five million, one hundred nine thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •