Base | Representation |
---|---|
bin | 10010010000000… |
… | …10010000001001 |
3 | 101200002100112022 |
4 | 21020002100021 |
5 | 303143220241 |
6 | 23105254225 |
7 | 3536224352 |
oct | 1110022011 |
9 | 350070468 |
10 | 153101321 |
11 | 7947031a |
12 | 43334375 |
13 | 259466c9 |
14 | 16494d29 |
15 | d69354b |
hex | 9202409 |
153101321 has 2 divisors, whose sum is σ = 153101322. Its totient is φ = 153101320.
The previous prime is 153101293. The next prime is 153101329. The reversal of 153101321 is 123101351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91948921 + 61152400 = 9589^2 + 7820^2 .
It is a cyclic number.
It is not a de Polignac number, because 153101321 - 214 = 153084937 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 153101321.
It is not a weakly prime, because it can be changed into another prime (153101329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76550660 + 76550661.
It is an arithmetic number, because the mean of its divisors is an integer number (76550661).
Almost surely, 2153101321 is an apocalyptic number.
It is an amenable number.
153101321 is a deficient number, since it is larger than the sum of its proper divisors (1).
153101321 is an equidigital number, since it uses as much as digits as its factorization.
153101321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 153101321 is about 12373.4118576891. The cubic root of 153101321 is about 534.9661620081.
Adding to 153101321 its reverse (123101351), we get a palindrome (276202672).
The spelling of 153101321 in words is "one hundred fifty-three million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •