Base | Representation |
---|---|
bin | 11110001010010… |
… | …00000101110101 |
3 | 122122001211122012 |
4 | 33011020011311 |
5 | 1004232031401 |
6 | 41034414005 |
7 | 6161324312 |
oct | 1705100565 |
9 | 578054565 |
10 | 253002101 |
11 | 11a8a4250 |
12 | 70891305 |
13 | 40553cb1 |
14 | 2585bd09 |
15 | 173288bb |
hex | f148175 |
253002101 has 8 divisors (see below), whose sum is σ = 277989600. Its totient is φ = 228345840.
The previous prime is 253002091. The next prime is 253002107. The reversal of 253002101 is 101200352.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253002101 is a prime.
It is a super-2 number, since 2×2530021012 = 128020126220828402, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253002107) 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 in 7 ways as a sum of consecutive naturals, for example, 81206 + ... + 84263.
It is an arithmetic number, because the mean of its divisors is an integer number (34748700).
Almost surely, 2253002101 is an apocalyptic number.
It is an amenable number.
253002101 is a deficient number, since it is larger than the sum of its proper divisors (24987499).
253002101 is a wasteful number, since it uses less digits than its factorization.
253002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165619.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 253002101 is about 15906.0397648189. The cubic root of 253002101 is about 632.4721050882.
Adding to 253002101 its reverse (101200352), we get a palindrome (354202453).
The spelling of 253002101 in words is "two hundred fifty-three million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •