Base | Representation |
---|---|
bin | 100010000111011… |
… | …1111010100000000 |
3 | 2221210002211222110 |
4 | 1010032333110000 |
5 | 4321030430112 |
6 | 305332335320 |
7 | 40240320054 |
oct | 10416772400 |
9 | 2853084873 |
10 | 1144780032 |
11 | 538220200 |
12 | 27b474540 |
13 | 15322c146 |
14 | ac077c64 |
15 | 6a77e13c |
hex | 443bf500 |
1144780032 has 216 divisors, whose sum is σ = 3410111488. Its totient is φ = 340623360.
The previous prime is 1144780031. The next prime is 1144780057. The reversal of 1144780032 is 2300874411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1144780031) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 9013953 + ... + 9014079.
Almost surely, 21144780032 is an apocalyptic number.
1144780032 is a gapful number since it is divisible by the number (12) 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 1144780032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1705055744).
1144780032 is an abundant number, since it is smaller than the sum of its proper divisors (2265331456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1144780032 is a wasteful number, since it uses less digits than its factorization.
1144780032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265 (or 240 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 30.
The square root of 1144780032 is about 33834.5981504140. The cubic root of 1144780032 is about 1046.1019585302.
The spelling of 1144780032 in words is "one billion, one hundred forty-four million, seven hundred eighty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.009 sec. • engine limits •