Base | Representation |
---|---|
bin | 10010010000011… |
… | …10110000010011 |
3 | 101200011221202222 |
4 | 21020032300103 |
5 | 303201340111 |
6 | 23110331255 |
7 | 3536526560 |
oct | 1110166023 |
9 | 350157688 |
10 | 153152531 |
11 | 794a5844 |
12 | 43359b2b |
13 | 25963acc |
14 | 164a9867 |
15 | d6a37db |
hex | 920ec13 |
153152531 has 8 divisors (see below), whose sum is σ = 175784544. Its totient is φ = 130708800.
The previous prime is 153152497. The next prime is 153152537. The reversal of 153152531 is 135251351.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 153152531 - 210 = 153151507 is a prime.
It is a super-2 number, since 2×1531525312 = 46911395503411922, which contains 22 as substring.
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 153152531.
It is not an unprimeable number, because it can be changed into a prime (153152537) 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 7 ways as a sum of consecutive naturals, for example, 45320 + ... + 48581.
It is an arithmetic number, because the mean of its divisors is an integer number (21973068).
Almost surely, 2153152531 is an apocalyptic number.
153152531 is a deficient number, since it is larger than the sum of its proper divisors (22632013).
153152531 is an equidigital number, since it uses as much as digits as its factorization.
153152531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94141.
The product of its digits is 2250, while the sum is 26.
The square root of 153152531 is about 12375.4810411555. The cubic root of 153152531 is about 535.0258013003.
The spelling of 153152531 in words is "one hundred fifty-three million, one hundred fifty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •