Base | Representation |
---|---|
bin | 10010001010010… |
… | …00111110011111 |
3 | 101121122210112021 |
4 | 21011020332133 |
5 | 302444424211 |
6 | 23041121011 |
7 | 3526614013 |
oct | 1105107637 |
9 | 347583467 |
10 | 152342431 |
11 | 78aa213a |
12 | 43029167 |
13 | 2573c167 |
14 | 16338543 |
15 | d593771 |
hex | 9148f9f |
152342431 has 8 divisors (see below), whose sum is σ = 156639344. Its totient is φ = 148055040.
The previous prime is 152342387. The next prime is 152342447. The reversal of 152342431 is 134243251.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152342431 is a prime.
It is a super-3 number, since 3×1523424313 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152342396 and 152342405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152348431) 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, 40876 + ... + 44446.
It is an arithmetic number, because the mean of its divisors is an integer number (19579918).
Almost surely, 2152342431 is an apocalyptic number.
152342431 is a deficient number, since it is larger than the sum of its proper divisors (4296913).
152342431 is a wasteful number, since it uses less digits than its factorization.
152342431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4761.
The product of its digits is 2880, while the sum is 25.
The square root of 152342431 is about 12342.7076040875. The cubic root of 152342431 is about 534.0807938370.
Adding to 152342431 its reverse (134243251), we get a palindrome (286585682).
The spelling of 152342431 in words is "one hundred fifty-two million, three hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •