Base | Representation |
---|---|
bin | 100001100001111… |
… | …0100110000110100 |
3 | 2220102000210011020 |
4 | 1003003310300310 |
5 | 4301004413040 |
6 | 303350141140 |
7 | 36610663005 |
oct | 10303646064 |
9 | 2812023136 |
10 | 1125076020 |
11 | 5280922a2 |
12 | 2749517b0 |
13 | 14c120673 |
14 | a95c91ac |
15 | 68b8acd0 |
hex | 430f4c34 |
1125076020 has 48 divisors (see below), whose sum is σ = 3235360128. Its totient is φ = 291911040.
The previous prime is 1125076019. The next prime is 1125076021. The reversal of 1125076020 is 206705211.
It is an interprime number because it is at equal distance from previous prime (1125076019) and next prime (1125076021).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125076021) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 251176 + ... + 255615.
It is an arithmetic number, because the mean of its divisors is an integer number (67403336).
Almost surely, 21125076020 is an apocalyptic number.
1125076020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1125076020 is an abundant number, since it is smaller than the sum of its proper divisors (2110284108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125076020 is a wasteful number, since it uses less digits than its factorization.
1125076020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506840 (or 506838 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 1125076020 is about 33542.1528826043. The cubic root of 1125076020 is about 1040.0653373646.
The spelling of 1125076020 in words is "one billion, one hundred twenty-five million, seventy-six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •