Base | Representation |
---|---|
bin | 100001100011101… |
… | …0101011101100000 |
3 | 2220110202112122210 |
4 | 1003013111131200 |
5 | 4301223341014 |
6 | 303422002120 |
7 | 36621545202 |
oct | 10307253540 |
9 | 2813675583 |
10 | 1125996384 |
11 | 528660827 |
12 | 275116340 |
13 | 14c383566 |
14 | a9788772 |
15 | 68cbd859 |
hex | 431d5760 |
1125996384 has 144 divisors (see below), whose sum is σ = 3137025024. Its totient is φ = 353203200.
The previous prime is 1125996367. The next prime is 1125996397. The reversal of 1125996384 is 4836995211.
It is a Harshad number since it is a multiple of its sum of digits (48).
Its product of digits (466560) is a multiple of the sum of its prime divisors (180).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15424572 + ... + 15424644.
It is an arithmetic number, because the mean of its divisors is an integer number (21784896).
Almost surely, 21125996384 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1125996384, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1568512512).
1125996384 is an abundant number, since it is smaller than the sum of its proper divisors (2011028640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125996384 is an equidigital number, since it uses as much as digits as its factorization.
1125996384 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261 (or 180 counting only the distinct ones).
The product of its digits is 466560, while the sum is 48.
The square root of 1125996384 is about 33555.8695908778. The cubic root of 1125996384 is about 1040.3488671806.
The spelling of 1125996384 in words is "one billion, one hundred twenty-five million, nine hundred ninety-six thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •