Base | Representation |
---|---|
bin | 100010011100000… |
… | …0010111001010000 |
3 | 2222112100122110101 |
4 | 1010320002321100 |
5 | 4331304330413 |
6 | 310355142144 |
7 | 40430643613 |
oct | 10470027120 |
9 | 2875318411 |
10 | 1155542608 |
11 | 5433012a0 |
12 | 282ba4954 |
13 | 155529b2c |
14 | ad67a17a |
15 | 6b6a7edd |
hex | 44e02e50 |
1155542608 has 160 divisors (see below), whose sum is σ = 2708398080. Its totient is φ = 471744000.
The previous prime is 1155542603. The next prime is 1155542617. The reversal of 1155542608 is 8062455511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1155542603) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 7360066 + ... + 7360222.
It is an arithmetic number, because the mean of its divisors is an integer number (16927488).
Almost surely, 21155542608 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 1155542608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1354199040).
1155542608 is an abundant number, since it is smaller than the sum of its proper divisors (1552855472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1155542608 is a wasteful number, since it uses less digits than its factorization.
1155542608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297 (or 291 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 37.
The square root of 1155542608 is about 33993.2729815768. The cubic root of 1155542608 is about 1049.3700251292.
The spelling of 1155542608 in words is "one billion, one hundred fifty-five million, five hundred forty-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •