Base | Representation |
---|---|
bin | 100010100110100… |
… | …0100011101010000 |
3 | 2222220201122201012 |
4 | 1011031010131100 |
5 | 4334212212112 |
6 | 311113230052 |
7 | 40525540115 |
oct | 10515043520 |
9 | 2886648635 |
10 | 1161054032 |
11 | 546426096 |
12 | 284a02328 |
13 | 156709628 |
14 | b02b290c |
15 | 6bde6022 |
hex | 45344750 |
1161054032 has 60 divisors (see below), whose sum is σ = 2403879996. Its totient is φ = 543129600.
The previous prime is 1161054029. The next prime is 1161054077. The reversal of 1161054032 is 2304501611.
It can be written as a sum of positive squares in 6 ways, for example, as 51897616 + 1109156416 = 7204^2 + 33304^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1161053989 and 1161054007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 891782 + ... + 893082.
Almost surely, 21161054032 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 1161054032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1201939998).
1161054032 is an abundant number, since it is smaller than the sum of its proper divisors (1242825964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161054032 is a wasteful number, since it uses less digits than its factorization.
1161054032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1536 (or 1513 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1161054032 is about 34074.2429409664. The cubic root of 1161054032 is about 1051.0357223940.
Adding to 1161054032 its reverse (2304501611), we get a palindrome (3465555643).
The spelling of 1161054032 in words is "one billion, one hundred sixty-one million, fifty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •