Base | Representation |
---|---|
bin | 100010011101011… |
… | …1101001001000000 |
3 | 2222120210101220121 |
4 | 1010322331021000 |
5 | 4332003233342 |
6 | 310423350024 |
7 | 40440301660 |
oct | 10472751100 |
9 | 2876711817 |
10 | 1156305472 |
11 | 543782463 |
12 | 2832b2314 |
13 | 15573612a |
14 | ad7d81a0 |
15 | 6b7a9067 |
hex | 44ebd240 |
1156305472 has 56 divisors (see below), whose sum is σ = 2627400384. Its totient is φ = 494602752.
The previous prime is 1156305461. The next prime is 1156305499. The reversal of 1156305472 is 2745036511.
It is a tau number, because it is divible by the number of its divisors (56).
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 7 ways as a sum of consecutive naturals, for example, 260778 + ... + 265174.
It is an arithmetic number, because the mean of its divisors is an integer number (46917864).
Almost surely, 21156305472 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 1156305472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1313700192).
1156305472 is an abundant number, since it is smaller than the sum of its proper divisors (1471094912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156305472 is an equidigital number, since it uses as much as digits as its factorization.
1156305472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5003 (or 4993 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 1156305472 is about 34004.4919385660. The cubic root of 1156305472 is about 1049.6008980572.
The spelling of 1156305472 in words is "one billion, one hundred fifty-six million, three hundred five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •