Base | Representation |
---|---|
bin | 100010011101011… |
… | …0000000111101000 |
3 | 2222120200200202012 |
4 | 1010322300013220 |
5 | 4332000032021 |
6 | 310422255052 |
7 | 40436660324 |
oct | 10472600750 |
9 | 2876620665 |
10 | 1156252136 |
11 | 543746386 |
12 | 283287488 |
13 | 155717a80 |
14 | ad7c2984 |
15 | 6b79835b |
hex | 44eb01e8 |
1156252136 has 96 divisors (see below), whose sum is σ = 2522378880. Its totient is φ = 493004160.
The previous prime is 1156252117. The next prime is 1156252157. The reversal of 1156252136 is 6312526511.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2298461 + ... + 2298963.
It is an arithmetic number, because the mean of its divisors is an integer number (26274780).
Almost surely, 21156252136 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 1156252136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1261189440).
1156252136 is an abundant number, since it is smaller than the sum of its proper divisors (1366126744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156252136 is a wasteful number, since it uses less digits than its factorization.
1156252136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607 (or 572 counting only the distinct ones).
The product of its digits is 10800, while the sum is 32.
The square root of 1156252136 is about 34003.7076801928. The cubic root of 1156252136 is about 1049.5847597686.
Adding to 1156252136 its reverse (6312526511), we get a palindrome (7468778647).
The spelling of 1156252136 in words is "one billion, one hundred fifty-six million, two hundred fifty-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •