Base | Representation |
---|---|
bin | 100000000010110… |
… | …1111000010100100 |
3 | 2202221021010011001 |
4 | 1000011233002210 |
5 | 4200230321340 |
6 | 254410123044 |
7 | 35434301500 |
oct | 10005570244 |
9 | 2687233131 |
10 | 1075245220 |
11 | 501a47715 |
12 | 260120484 |
13 | 1419c429a |
14 | a2b37300 |
15 | 645e629a |
hex | 4016f0a4 |
1075245220 has 36 divisors (see below), whose sum is σ = 2626672860. Its totient is φ = 368655168.
The previous prime is 1075245217. The next prime is 1075245233. The reversal of 1075245220 is 225425701.
It can be written as a sum of positive squares in 2 ways, for example, as 185177664 + 890067556 = 13608^2 + 29834^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 547615 + ... + 549574.
It is an arithmetic number, because the mean of its divisors is an integer number (72963135).
Almost surely, 21075245220 is an apocalyptic number.
1075245220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1075245220 is an abundant number, since it is smaller than the sum of its proper divisors (1551427640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1075245220 is a wasteful number, since it uses less digits than its factorization.
1075245220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1097212 (or 1097203 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 28.
The square root of 1075245220 is about 32790.9319782162. The cubic root of 1075245220 is about 1024.4776938397.
The spelling of 1075245220 in words is "one billion, seventy-five million, two hundred forty-five thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •