Base | Representation |
---|---|
bin | 10010001010001… |
… | …10101101010101 |
3 | 101121122022210012 |
4 | 21011012231111 |
5 | 302444130031 |
6 | 23041010005 |
7 | 3526544642 |
oct | 1105065525 |
9 | 347568705 |
10 | 152333141 |
11 | 78a96164 |
12 | 43023905 |
13 | 25737b6c |
14 | 16334dc9 |
15 | d590b2b |
hex | 9146b55 |
152333141 has 4 divisors (see below), whose sum is σ = 161293932. Its totient is φ = 143372352.
The previous prime is 152333123. The next prime is 152333161. The reversal of 152333141 is 141333251.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79299025 + 73034116 = 8905^2 + 8546^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152333141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152333161) 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, 4480370 + ... + 4480403.
It is an arithmetic number, because the mean of its divisors is an integer number (40323483).
Almost surely, 2152333141 is an apocalyptic number.
It is an amenable number.
152333141 is a deficient number, since it is larger than the sum of its proper divisors (8960791).
152333141 is an equidigital number, since it uses as much as digits as its factorization.
152333141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8960790.
The product of its digits is 1080, while the sum is 23.
The square root of 152333141 is about 12342.3312627720. The cubic root of 152333141 is about 534.0699373488.
Adding to 152333141 its reverse (141333251), we get a palindrome (293666392).
The spelling of 152333141 in words is "one hundred fifty-two million, three hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •