Base | Representation |
---|---|
bin | 100010010011100… |
… | …1101101101010010 |
3 | 2222020001111010010 |
4 | 1010213031231102 |
5 | 4324142133300 |
6 | 310120415350 |
7 | 40345306311 |
oct | 10447155522 |
9 | 2866044103 |
10 | 1151130450 |
11 | 540868388 |
12 | 281617556 |
13 | 1546437a2 |
14 | acc4c278 |
15 | 6b0d5a50 |
hex | 449cdb52 |
1151130450 has 144 divisors (see below), whose sum is σ = 3036368160. Its totient is φ = 288541440.
The previous prime is 1151130419. The next prime is 1151130467. The reversal of 1151130450 is 540311511.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 7062069 + ... + 7062231.
It is an arithmetic number, because the mean of its divisors is an integer number (21085890).
Almost surely, 21151130450 is an apocalyptic number.
1151130450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1151130450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1518184080).
1151130450 is an abundant number, since it is smaller than the sum of its proper divisors (1885237710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1151130450 is a wasteful number, since it uses less digits than its factorization.
1151130450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313 (or 285 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 1151130450 is about 33928.3133975151. The cubic root of 1151130450 is about 1048.0327336910.
Adding to 1151130450 its reverse (540311511), we get a palindrome (1691441961).
The spelling of 1151130450 in words is "one billion, one hundred fifty-one million, one hundred thirty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •