Base | Representation |
---|---|
bin | 11110001100110… |
… | …00010010101001 |
3 | 122122200112020212 |
4 | 33012120102221 |
5 | 1004323034401 |
6 | 41045430505 |
7 | 6164163116 |
oct | 1706302251 |
9 | 578615225 |
10 | 253330601 |
11 | 11aaa9037 |
12 | 70a0b435 |
13 | 4063a684 |
14 | 2590590d |
15 | 17390dbb |
hex | f1984a9 |
253330601 has 8 divisors (see below), whose sum is σ = 264589440. Its totient is φ = 242304048.
The previous prime is 253330589. The next prime is 253330613. The reversal of 253330601 is 106033352.
It is an interprime number because it is at equal distance from previous prime (253330589) and next prime (253330613).
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 253330601 - 26 = 253330537 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (253330681) 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, 55841 + ... + 60206.
It is an arithmetic number, because the mean of its divisors is an integer number (33073680).
Almost surely, 2253330601 is an apocalyptic number.
It is an amenable number.
253330601 is a deficient number, since it is larger than the sum of its proper divisors (11258839).
253330601 is a wasteful number, since it uses less digits than its factorization.
253330601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116143.
The product of its (nonzero) digits is 1620, while the sum is 23.
The square root of 253330601 is about 15916.3626812158. The cubic root of 253330601 is about 632.7457223537.
Adding to 253330601 its reverse (106033352), we get a palindrome (359363953).
The spelling of 253330601 in words is "two hundred fifty-three million, three hundred thirty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •