Base | Representation |
---|---|
bin | 11110001011000… |
… | …00100000111101 |
3 | 122122020220212101 |
4 | 33011200200331 |
5 | 1004243232031 |
6 | 41040505101 |
7 | 6162222055 |
oct | 1705404075 |
9 | 578226771 |
10 | 253102141 |
11 | 11a962426 |
12 | 7091b191 |
13 | 4058a6a6 |
14 | 25886565 |
15 | 17348361 |
hex | f16083d |
253102141 has 2 divisors, whose sum is σ = 253102142. Its totient is φ = 253102140.
The previous prime is 253102139. The next prime is 253102177. The reversal of 253102141 is 141201352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 251222500 + 1879641 = 15850^2 + 1371^2 .
It is a cyclic number.
It is not a de Polignac number, because 253102141 - 21 = 253102139 is a prime.
Together with 253102139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253102121) 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, 126551070 + 126551071.
It is an arithmetic number, because the mean of its divisors is an integer number (126551071).
Almost surely, 2253102141 is an apocalyptic number.
It is an amenable number.
253102141 is a deficient number, since it is larger than the sum of its proper divisors (1).
253102141 is an equidigital number, since it uses as much as digits as its factorization.
253102141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 253102141 is about 15909.1841714150. The cubic root of 253102141 is about 632.5554564008. Note that the first 3 decimals are identical.
Adding to 253102141 its reverse (141201352), we get a palindrome (394303493).
The spelling of 253102141 in words is "two hundred fifty-three million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •