Base | Representation |
---|---|
bin | 100010010010011… |
… | …0000010000000000 |
3 | 2222011211201102020 |
4 | 1010210300100000 |
5 | 4324011014004 |
6 | 310054521440 |
7 | 40336652100 |
oct | 10444602000 |
9 | 2864751366 |
10 | 1150485504 |
11 | 540467873 |
12 | 281366280 |
13 | 15447906c |
14 | acb21200 |
15 | 6b0098d9 |
hex | 44930400 |
1150485504 has 132 divisors (see below), whose sum is σ = 3567577104. Its totient is φ = 328667136.
The previous prime is 1150485487. The next prime is 1150485509. The reversal of 1150485504 is 4055840511.
It is not an unprimeable number, because it can be changed into a prime (1150485509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 146707 + ... + 154349.
Almost surely, 21150485504 is an apocalyptic number.
1150485504 is a gapful number since it is divisible by the number (14) 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 1150485504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1783788552).
1150485504 is an abundant number, since it is smaller than the sum of its proper divisors (2417091600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150485504 is an equidigital number, since it uses as much as digits as its factorization.
1150485504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7680 (or 7655 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
The square root of 1150485504 is about 33918.8075262088. The cubic root of 1150485504 is about 1047.8369693758.
The spelling of 1150485504 in words is "one billion, one hundred fifty million, four hundred eighty-five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •