Base | Representation |
---|---|
bin | 100001100010001… |
… | …1111011110111000 |
3 | 2220102100200011222 |
4 | 1003010133132320 |
5 | 4301031013000 |
6 | 303354011212 |
7 | 36612322106 |
oct | 10304373670 |
9 | 2812320158 |
10 | 1125251000 |
11 | 5281a1805 |
12 | 274a16b08 |
13 | 14c1821c3 |
14 | a9632c76 |
15 | 68bc2a85 |
hex | 4311f7b8 |
1125251000 has 64 divisors (see below), whose sum is σ = 2640924000. Its totient is φ = 448761600.
The previous prime is 1125250967. The next prime is 1125251021. The reversal of 1125251000 is 1525211.
It is a self number, because there is not a number n which added to its sum of digits gives 1125251000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 377516 + ... + 380484.
Almost surely, 21125251000 is an apocalyptic number.
1125251000 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 1125251000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1320462000).
1125251000 is an abundant number, since it is smaller than the sum of its proper divisors (1515673000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125251000 is a wasteful number, since it uses less digits than its factorization.
1125251000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3369 (or 3355 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 1125251000 is about 33544.7611408995. The cubic root of 1125251000 is about 1040.1192540764.
Adding to 1125251000 its reverse (1525211), we get a palindrome (1126776211).
The spelling of 1125251000 in words is "one billion, one hundred twenty-five million, two hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •