Base | Representation |
---|---|
bin | 100010010101100… |
… | …0100001111000110 |
3 | 2222021221210021101 |
4 | 1010223010033012 |
5 | 4324421441410 |
6 | 310154210314 |
7 | 40360013263 |
oct | 10453041706 |
9 | 2867853241 |
10 | 1152140230 |
11 | 54139800a |
12 | 281a2399a |
13 | 1549082a7 |
14 | ad03226a |
15 | 6b234d3a |
hex | 44ac43c6 |
1152140230 has 8 divisors (see below), whose sum is σ = 2073852432. Its totient is φ = 460856088.
The previous prime is 1152140207. The next prime is 1152140233. The reversal of 1152140230 is 320412511.
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 = 1152140198 and 1152140207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152140233) 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 3 ways as a sum of consecutive naturals, for example, 57607002 + ... + 57607021.
It is an arithmetic number, because the mean of its divisors is an integer number (259231554).
Almost surely, 21152140230 is an apocalyptic number.
1152140230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1152140230 is a deficient number, since it is larger than the sum of its proper divisors (921712202).
1152140230 is a wasteful number, since it uses less digits than its factorization.
1152140230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115214030.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1152140230 is about 33943.1912170909. The cubic root of 1152140230 is about 1048.3390914399.
Adding to 1152140230 its reverse (320412511), we get a palindrome (1472552741).
The spelling of 1152140230 in words is "one billion, one hundred fifty-two million, one hundred forty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •