Base | Representation |
---|---|
bin | 100010010101010… |
… | …0011101001011110 |
3 | 2222021201000011200 |
4 | 1010222203221132 |
5 | 4324403204000 |
6 | 310151300330 |
7 | 40355616156 |
oct | 10452435136 |
9 | 2867630150 |
10 | 1152006750 |
11 | 5413067a4 |
12 | 28197a6a6 |
13 | 15488c5cb |
14 | acdd9766 |
15 | 6b20a500 |
hex | 44aa3a5e |
1152006750 has 192 divisors, whose sum is σ = 3295873152. Its totient is φ = 289766400.
The previous prime is 1152006749. The next prime is 1152006763. The reversal of 1152006750 is 576002511.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5847652 + ... + 5847848.
It is an arithmetic number, because the mean of its divisors is an integer number (17166006).
Almost surely, 21152006750 is an apocalyptic number.
1152006750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1152006750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1647936576).
1152006750 is an abundant number, since it is smaller than the sum of its proper divisors (2143866402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1152006750 is a wasteful number, since it uses less digits than its factorization.
1152006750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356 (or 343 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 1152006750 is about 33941.2249336997. The cubic root of 1152006750 is about 1048.2986051338.
It can be divided in two parts, 115200 and 6750, that multiplied together give a 5-th power (777600000 = 605).
The spelling of 1152006750 in words is "one billion, one hundred fifty-two million, six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •