Base | Representation |
---|---|
bin | 100010010001101… |
… | …1000000011000110 |
3 | 2222011011100211201 |
4 | 1010203120003012 |
5 | 4323412433410 |
6 | 310043053114 |
7 | 40333615603 |
oct | 10443300306 |
9 | 2864140751 |
10 | 1150124230 |
11 | 5402403a2 |
12 | 28121119a |
13 | 1543807a8 |
14 | aca696aa |
15 | 6ae8783a |
hex | 448d80c6 |
1150124230 has 8 divisors (see below), whose sum is σ = 2070223632. Its totient is φ = 460049688.
The previous prime is 1150124219. The next prime is 1150124233. The reversal of 1150124230 is 324210511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1150124198 and 1150124207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150124233) 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 3 ways as a sum of consecutive naturals, for example, 57506202 + ... + 57506221.
It is an arithmetic number, because the mean of its divisors is an integer number (258777954).
Almost surely, 21150124230 is an apocalyptic number.
1150124230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1150124230 is a deficient number, since it is larger than the sum of its proper divisors (920099402).
1150124230 is a wasteful number, since it uses less digits than its factorization.
1150124230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115012430.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1150124230 is about 33913.4815375833. The cubic root of 1150124230 is about 1047.7272777475.
Adding to 1150124230 its reverse (324210511), we get a palindrome (1474334741).
The spelling of 1150124230 in words is "one billion, one hundred fifty million, one hundred twenty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •