Base | Representation |
---|---|
bin | 100010010001011… |
… | …1100000010000000 |
3 | 2222010221112102102 |
4 | 1010202330002000 |
5 | 4323400300342 |
6 | 310040405532 |
7 | 40332630203 |
oct | 10442740200 |
9 | 2863845372 |
10 | 1150009472 |
11 | 540172157 |
12 | 2811768a8 |
13 | 1543404a1 |
14 | aca3993a |
15 | 6ae63832 |
hex | 448bc080 |
1150009472 has 64 divisors (see below), whose sum is σ = 2439383040. Its totient is φ = 538152960.
The previous prime is 1150009459. The next prime is 1150009477. The reversal of 1150009472 is 2749000511.
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (1150009477) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 414233 + ... + 416999.
It is an arithmetic number, because the mean of its divisors is an integer number (38115360).
Almost surely, 21150009472 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 1150009472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1219691520).
1150009472 is an abundant number, since it is smaller than the sum of its proper divisors (1289373568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150009472 is a wasteful number, since it uses less digits than its factorization.
1150009472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2989 (or 2977 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 1150009472 is about 33911.7895723596. The cubic root of 1150009472 is about 1047.6924296030.
Adding to 1150009472 its reverse (2749000511), we get a palindrome (3899009983).
The spelling of 1150009472 in words is "one billion, one hundred fifty million, nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •