Base | Representation |
---|---|
bin | 11110001100110… |
… | …10101100111101 |
3 | 122122201000210122 |
4 | 33012122230331 |
5 | 1004323343402 |
6 | 41045544325 |
7 | 6164233655 |
oct | 1706325475 |
9 | 578630718 |
10 | 253340477 |
11 | 1200054a5 |
12 | 70a150a5 |
13 | 40642010 |
14 | 25909365 |
15 | 17393ca2 |
hex | f19ab3d |
253340477 has 32 divisors (see below), whose sum is σ = 301771008. Its totient is φ = 210502656.
The previous prime is 253340473. The next prime is 253340531. The reversal of 253340477 is 774043352.
It is not a de Polignac number, because 253340477 - 22 = 253340473 is a prime.
It is a super-3 number, since 3×2533404773 (a number of 26 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253340473) 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 31 ways as a sum of consecutive naturals, for example, 503408 + ... + 503910.
It is an arithmetic number, because the mean of its divisors is an integer number (9430344).
Almost surely, 2253340477 is an apocalyptic number.
It is an amenable number.
253340477 is a deficient number, since it is larger than the sum of its proper divisors (48430531).
253340477 is a wasteful number, since it uses less digits than its factorization.
253340477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629.
The product of its (nonzero) digits is 70560, while the sum is 35.
The square root of 253340477 is about 15916.6729249551. The cubic root of 253340477 is about 632.7539446997.
The spelling of 253340477 in words is "two hundred fifty-three million, three hundred forty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •