Base | Representation |
---|---|
bin | 100001101111111… |
… | …1110001100000000 |
3 | 2220220220122202001 |
4 | 1003133332030000 |
5 | 4304402022111 |
6 | 304212233344 |
7 | 40030464034 |
oct | 10337761400 |
9 | 2826818661 |
10 | 1132454656 |
11 | 531271a43 |
12 | 27730b854 |
13 | 150805018 |
14 | aa58a1c4 |
15 | 696471c1 |
hex | 437fe300 |
1132454656 has 72 divisors (see below), whose sum is σ = 2307594240. Its totient is φ = 554566656.
The previous prime is 1132454641. The next prime is 1132454681. The reversal of 1132454656 is 6564542311.
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, 4738185 + ... + 4738423.
It is an arithmetic number, because the mean of its divisors is an integer number (32049920).
Almost surely, 21132454656 is an apocalyptic number.
1132454656 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 1132454656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1153797120).
1132454656 is an abundant number, since it is smaller than the sum of its proper divisors (1175139584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132454656 is an equidigital number, since it uses as much as digits as its factorization.
1132454656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561 (or 547 counting only the distinct ones).
The product of its digits is 86400, while the sum is 37.
The square root of 1132454656 is about 33651.9636276994. The cubic root of 1132454656 is about 1042.3340870444.
Adding to 1132454656 its reverse (6564542311), we get a palindrome (7696996967).
The spelling of 1132454656 in words is "one billion, one hundred thirty-two million, four hundred fifty-four thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •