Base | Representation |
---|---|
bin | 10010001100010… |
… | …01001000111001 |
3 | 101122011011000222 |
4 | 21012021020321 |
5 | 303031331431 |
6 | 23050505425 |
7 | 3532060145 |
oct | 1106111071 |
9 | 348134028 |
10 | 152605241 |
11 | 79161638 |
12 | 43135275 |
13 | 25801979 |
14 | 163a6225 |
15 | d5e657b |
hex | 9189239 |
152605241 has 4 divisors (see below), whose sum is σ = 153126372. Its totient is φ = 152084112.
The previous prime is 152605223. The next prime is 152605267. The reversal of 152605241 is 142506251.
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 74459641 + 78145600 = 8629^2 + 8840^2 .
It is a cyclic number.
It is not a de Polignac number, because 152605241 - 26 = 152605177 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 152605241.
It is not an unprimeable number, because it can be changed into a prime (152605841) 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, 260126 + ... + 260711.
It is an arithmetic number, because the mean of its divisors is an integer number (38281593).
Almost surely, 2152605241 is an apocalyptic number.
It is an amenable number.
152605241 is a deficient number, since it is larger than the sum of its proper divisors (521131).
152605241 is an equidigital number, since it uses as much as digits as its factorization.
152605241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521130.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 152605241 is about 12353.3493838716. The cubic root of 152605241 is about 534.3877364177.
The spelling of 152605241 in words is "one hundred fifty-two million, six hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •