Base | Representation |
---|---|
bin | 100010000110000… |
… | …1011111111011100 |
3 | 2221201201112102202 |
4 | 1010030023333130 |
5 | 4320333424112 |
6 | 305304511032 |
7 | 40231140500 |
oct | 10414137734 |
9 | 2851645382 |
10 | 1144045532 |
11 | 537869383 |
12 | 27b17b478 |
13 | 153032a26 |
14 | abd26300 |
15 | 6a6866c2 |
hex | 4430bfdc |
1144045532 has 72 divisors (see below), whose sum is σ = 2485718928. Its totient is φ = 457766400.
The previous prime is 1144045519. The next prime is 1144045543. The reversal of 1144045532 is 2355404411.
It is a junction number, because it is equal to n+sod(n) for n = 1144045495 and 1144045504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 435182 + ... + 437802.
It is an arithmetic number, because the mean of its divisors is an integer number (34523874).
Almost surely, 21144045532 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 1144045532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1242859464).
1144045532 is an abundant number, since it is smaller than the sum of its proper divisors (1341673396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1144045532 is a wasteful number, since it uses less digits than its factorization.
1144045532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2787 (or 2778 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
The square root of 1144045532 is about 33823.7421347786. The cubic root of 1144045532 is about 1045.8781815440.
Adding to 1144045532 its reverse (2355404411), we get a palindrome (3499449943).
The spelling of 1144045532 in words is "one billion, one hundred forty-four million, forty-five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •