Base | Representation |
---|---|
bin | 100010010101100… |
… | …0100010010010001 |
3 | 2222021221210112220 |
4 | 1010223010102101 |
5 | 4324421443213 |
6 | 310154211253 |
7 | 40360014003 |
oct | 10453042221 |
9 | 2867853486 |
10 | 1152140433 |
11 | 541398184 |
12 | 281a23b29 |
13 | 154908402 |
14 | ad032373 |
15 | 6b234e23 |
hex | 44ac4491 |
1152140433 has 4 divisors (see below), whose sum is σ = 1536187248. Its totient is φ = 768093620.
The previous prime is 1152140413. The next prime is 1152140441. The reversal of 1152140433 is 3340412511.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1152140433 - 28 = 1152140177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1152140413) 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, 192023403 + ... + 192023408.
It is an arithmetic number, because the mean of its divisors is an integer number (384046812).
Almost surely, 21152140433 is an apocalyptic number.
It is an amenable number.
1152140433 is a deficient number, since it is larger than the sum of its proper divisors (384046815).
1152140433 is an equidigital number, since it uses as much as digits as its factorization.
1152140433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384046814.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 1152140433 is about 33943.1942073812. The cubic root of 1152140433 is about 1048.3391530102.
Adding to 1152140433 its reverse (3340412511), we get a palindrome (4492552944).
The spelling of 1152140433 in words is "one billion, one hundred fifty-two million, one hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •