Base | Representation |
---|---|
bin | 100001100010001… |
… | …0000110101011000 |
3 | 2220102020121212202 |
4 | 1003010100311120 |
5 | 4301022103000 |
6 | 303352425332 |
7 | 36611652143 |
oct | 10304206530 |
9 | 2812217782 |
10 | 1125191000 |
11 | 52816071a |
12 | 2749a8248 |
13 | 14c160abb |
14 | a961905a |
15 | 68baedd5 |
hex | 43110d58 |
1125191000 has 64 divisors (see below), whose sum is σ = 2638003680. Its totient is φ = 449212800.
The previous prime is 1125190999. The next prime is 1125191017. The reversal of 1125191000 is 1915211.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 876359 + ... + 877641.
Almost surely, 21125191000 is an apocalyptic number.
1125191000 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 1125191000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1319001840).
1125191000 is an abundant number, since it is smaller than the sum of its proper divisors (1512812680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125191000 is a wasteful number, since it uses less digits than its factorization.
1125191000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2181 (or 2167 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 20.
The square root of 1125191000 is about 33543.8668015481. The cubic root of 1125191000 is about 1040.1007668635.
The spelling of 1125191000 in words is "one billion, one hundred twenty-five million, one hundred ninety-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •