Base | Representation |
---|---|
bin | 100010011000100… |
… | …1100000010100000 |
3 | 2222101222022200101 |
4 | 1010301030002200 |
5 | 4330324320211 |
6 | 310252432144 |
7 | 40406446132 |
oct | 10461140240 |
9 | 2871868611 |
10 | 1153745056 |
11 | 542293812 |
12 | 282478654 |
13 | 15504a8a9 |
14 | ad32d052 |
15 | 6b4505c1 |
hex | 44c4c0a0 |
1153745056 has 48 divisors (see below), whose sum is σ = 2395280160. Its totient is φ = 545529600.
The previous prime is 1153745023. The next prime is 1153745081. The reversal of 1153745056 is 6505473511.
It is a super-2 number, since 2×11537450562 = 2662255308488886272, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 424855 + ... + 427561.
It is an arithmetic number, because the mean of its divisors is an integer number (49901670).
Almost surely, 21153745056 is an apocalyptic number.
1153745056 is a gapful number since it is divisible by the number (16) 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 1153745056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1197640080).
1153745056 is an abundant number, since it is smaller than the sum of its proper divisors (1241535104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1153745056 is a wasteful number, since it uses less digits than its factorization.
1153745056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437 (or 3429 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 37.
The square root of 1153745056 is about 33966.8228717377. The cubic root of 1153745056 is about 1048.8256124515.
The spelling of 1153745056 in words is "one billion, one hundred fifty-three million, seven hundred forty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •