Base | Representation |
---|---|
bin | 11110001100111… |
… | …01110010110101 |
3 | 122122201200011200 |
4 | 33012131302311 |
5 | 1004324300031 |
6 | 41050123113 |
7 | 6164315616 |
oct | 1706356265 |
9 | 578650150 |
10 | 253353141 |
11 | 120013a68 |
12 | 70a20499 |
13 | 40647a02 |
14 | 2590dc0d |
15 | 173978e6 |
hex | f19dcb5 |
253353141 has 12 divisors (see below), whose sum is σ = 368627532. Its totient is φ = 167668416.
The previous prime is 253353131. The next prime is 253353151. The reversal of 253353141 is 141353352.
It is an interprime number because it is at equal distance from previous prime (253353131) and next prime (253353151).
It can be written as a sum of positive squares in 2 ways, for example, as 188952516 + 64400625 = 13746^2 + 8025^2 .
It is not a de Polignac number, because 253353141 - 27 = 253353013 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253353131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 101506 + ... + 103971.
It is an arithmetic number, because the mean of its divisors is an integer number (30718961).
Almost surely, 2253353141 is an apocalyptic number.
It is an amenable number.
253353141 is a deficient number, since it is larger than the sum of its proper divisors (115274391).
253353141 is a wasteful number, since it uses less digits than its factorization.
253353141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205620 (or 205617 counting only the distinct ones).
The product of its digits is 5400, while the sum is 27.
The square root of 253353141 is about 15917.0707418168. The cubic root of 253353141 is about 632.7644879056.
The spelling of 253353141 in words is "two hundred fifty-three million, three hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •