Base | Representation |
---|---|
bin | 100001011011001… |
… | …1101000001110000 |
3 | 2220011102201002000 |
4 | 1002312131001300 |
5 | 4244110232203 |
6 | 303143054000 |
7 | 36536124042 |
oct | 10266350160 |
9 | 2804381060 |
10 | 1121570928 |
11 | 526108925 |
12 | 273741300 |
13 | 14b49414a |
14 | a8d55a92 |
15 | 686e74a3 |
hex | 42d9d070 |
1121570928 has 40 divisors (see below), whose sum is σ = 3219325200. Its totient is φ = 373856832.
The previous prime is 1121570887. The next prime is 1121570951. The reversal of 1121570928 is 8290751211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 1121570892 and 1121570901.
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 7 ways as a sum of consecutive naturals, for example, 1297683 + ... + 1298546.
It is an arithmetic number, because the mean of its divisors is an integer number (80483130).
Almost surely, 21121570928 is an apocalyptic number.
1121570928 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1121570928 is an abundant number, since it is smaller than the sum of its proper divisors (2097754272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121570928 is a wasteful number, since it uses less digits than its factorization.
1121570928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2596246 (or 2596234 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 36.
The square root of 1121570928 is about 33489.8630633211. The cubic root of 1121570928 is about 1038.9841312999.
The spelling of 1121570928 in words is "one billion, one hundred twenty-one million, five hundred seventy thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •