Base | Representation |
---|---|
bin | 10010010000110… |
… | …11101100011001 |
3 | 101200021122110212 |
4 | 21020123230121 |
5 | 303210034104 |
6 | 23111420505 |
7 | 3540140231 |
oct | 1110335431 |
9 | 350248425 |
10 | 153205529 |
11 | 79531644 |
12 | 43384735 |
13 | 25981c79 |
14 | 164c0cc1 |
15 | d6b436e |
hex | 921bb19 |
153205529 has 2 divisors, whose sum is σ = 153205530. Its totient is φ = 153205528.
The previous prime is 153205519. The next prime is 153205541. The reversal of 153205529 is 925502351.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152646025 + 559504 = 12355^2 + 748^2 .
It is a cyclic number.
It is not a de Polignac number, because 153205529 - 216 = 153139993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153205495 and 153205504.
It is not a weakly prime, because it can be changed into another prime (153205519) 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 as a sum of consecutive naturals, namely, 76602764 + 76602765.
It is an arithmetic number, because the mean of its divisors is an integer number (76602765).
Almost surely, 2153205529 is an apocalyptic number.
It is an amenable number.
153205529 is a deficient number, since it is larger than the sum of its proper divisors (1).
153205529 is an equidigital number, since it uses as much as digits as its factorization.
153205529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 32.
The square root of 153205529 is about 12377.6221060428. The cubic root of 153205529 is about 535.0875089045.
The spelling of 153205529 in words is "one hundred fifty-three million, two hundred five thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •