Base | Representation |
---|---|
bin | 10010010000010… |
… | …10100011011001 |
3 | 101200011002011120 |
4 | 21020022203121 |
5 | 303200312241 |
6 | 23110115453 |
7 | 3536425443 |
oct | 1110124331 |
9 | 350132146 |
10 | 153135321 |
11 | 79493919 |
12 | 4334bb89 |
13 | 25959021 |
14 | 164a3493 |
15 | d69d666 |
hex | 920a8d9 |
153135321 has 4 divisors (see below), whose sum is σ = 204180432. Its totient is φ = 102090212.
The previous prime is 153135313. The next prime is 153135331. The reversal of 153135321 is 123531351.
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 not a de Polignac number, because 153135321 - 23 = 153135313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153135291 and 153135300.
It is not an unprimeable number, because it can be changed into a prime (153135331) 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, 25522551 + ... + 25522556.
It is an arithmetic number, because the mean of its divisors is an integer number (51045108).
Almost surely, 2153135321 is an apocalyptic number.
It is an amenable number.
153135321 is a deficient number, since it is larger than the sum of its proper divisors (51045111).
153135321 is an equidigital number, since it uses as much as digits as its factorization.
153135321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51045110.
The product of its digits is 1350, while the sum is 24.
The square root of 153135321 is about 12374.7856951141. The cubic root of 153135321 is about 535.0057599753.
Adding to 153135321 its reverse (123531351), we get a palindrome (276666672).
The spelling of 153135321 in words is "one hundred fifty-three million, one hundred thirty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •