Base | Representation |
---|---|
bin | 100010001001001… |
… | …0010000001111100 |
3 | 2221211201200221010 |
4 | 1010102102001330 |
5 | 4321241040012 |
6 | 305403035220 |
7 | 40250543304 |
oct | 10422220174 |
9 | 2854650833 |
10 | 1145643132 |
11 | 53875a707 |
12 | 27b80bb10 |
13 | 153471c5a |
14 | ac220604 |
15 | 6a89ec3c |
hex | 4449207c |
1145643132 has 24 divisors (see below), whose sum is σ = 2677517136. Its totient is φ = 381259648.
The previous prime is 1145643131. The next prime is 1145643137. The reversal of 1145643132 is 2313465411.
It is a self number, because there is not a number n which added to its sum of digits gives 1145643132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145643131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69963 + ... + 84770.
It is an arithmetic number, because the mean of its divisors is an integer number (111563214).
Almost surely, 21145643132 is an apocalyptic number.
1145643132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1145643132 is an abundant number, since it is smaller than the sum of its proper divisors (1531874004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145643132 is a wasteful number, since it uses less digits than its factorization.
1145643132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155357 (or 155355 counting only the distinct ones).
The product of its digits is 8640, while the sum is 30.
The square root of 1145643132 is about 33847.3504428338. The cubic root of 1145643132 is about 1046.3647932410.
The spelling of 1145643132 in words is "one billion, one hundred forty-five million, six hundred forty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •