Base | Representation |
---|---|
bin | 10010001101001… |
… | …10011101010101 |
3 | 101122101020202211 |
4 | 21012212131111 |
5 | 303044202313 |
6 | 23053233421 |
7 | 3533100235 |
oct | 1106463525 |
9 | 348336684 |
10 | 152725333 |
11 | 79233892 |
12 | 43192871 |
13 | 25844527 |
14 | 163d7cc5 |
15 | d61be3d |
hex | 91a6755 |
152725333 has 4 divisors (see below), whose sum is σ = 152856928. Its totient is φ = 152593740.
The previous prime is 152725327. The next prime is 152725337. The reversal of 152725333 is 333527251.
152725333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a de Polignac number, because none of the positive numbers 2k-152725333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152725295 and 152725304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152725337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64041 + ... + 66382.
It is an arithmetic number, because the mean of its divisors is an integer number (38214232).
Almost surely, 2152725333 is an apocalyptic number.
It is an amenable number.
152725333 is a deficient number, since it is larger than the sum of its proper divisors (131595).
152725333 is a wasteful number, since it uses less digits than its factorization.
152725333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131594.
The product of its digits is 18900, while the sum is 31.
The square root of 152725333 is about 12358.2091340129. The cubic root of 152725333 is about 534.5278776621.
The spelling of 152725333 in words is "one hundred fifty-two million, seven hundred twenty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •