Base | Representation |
---|---|
bin | 11110001010001… |
… | …11110110110101 |
3 | 122122001210022122 |
4 | 33011013312311 |
5 | 1004232014031 |
6 | 41034405325 |
7 | 6161321441 |
oct | 1705076665 |
9 | 578053278 |
10 | 253001141 |
11 | 11a8a3558 |
12 | 70890845 |
13 | 40553723 |
14 | 2585b821 |
15 | 1732847b |
hex | f147db5 |
253001141 has 8 divisors (see below), whose sum is σ = 258971520. Its totient is φ = 247055328.
The previous prime is 253001117. The next prime is 253001149. The reversal of 253001141 is 141100352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 253001141 - 214 = 252984757 is a prime.
It is a super-3 number, since 3×2530011413 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253001149) 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 7 ways as a sum of consecutive naturals, for example, 15590 + ... + 27368.
It is an arithmetic number, because the mean of its divisors is an integer number (32371440).
Almost surely, 2253001141 is an apocalyptic number.
It is an amenable number.
253001141 is a deficient number, since it is larger than the sum of its proper divisors (5970379).
253001141 is a wasteful number, since it uses less digits than its factorization.
253001141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12283.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 253001141 is about 15906.0095875741. The cubic root of 253001141 is about 632.4713051291.
Adding to 253001141 its reverse (141100352), we get a palindrome (394101493).
The spelling of 253001141 in words is "two hundred fifty-three million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •