Base | Representation |
---|---|
bin | 11110001100010… |
… | …01101111111111 |
3 | 122122120111112212 |
4 | 33012021233333 |
5 | 1004314133124 |
6 | 41044251035 |
7 | 6163524350 |
oct | 1706115777 |
9 | 578514485 |
10 | 253271039 |
11 | 11aa6830a |
12 | 709a0a7b |
13 | 40619528 |
14 | 258cbd27 |
15 | 1737d40e |
hex | f189bff |
253271039 has 4 divisors (see below), whose sum is σ = 289452624. Its totient is φ = 217089456.
The previous prime is 253271021. The next prime is 253271069. The reversal of 253271039 is 930172352.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 253271039 - 216 = 253205503 is a prime.
It is a super-2 number, since 2×2532710392 = 128292438392279042, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 253270996 and 253271014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253271069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18090782 + ... + 18090795.
It is an arithmetic number, because the mean of its divisors is an integer number (72363156).
Almost surely, 2253271039 is an apocalyptic number.
253271039 is a deficient number, since it is larger than the sum of its proper divisors (36181585).
253271039 is an equidigital number, since it uses as much as digits as its factorization.
253271039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36181584.
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 253271039 is about 15914.4914778952. The cubic root of 253271039 is about 632.6961289836.
The spelling of 253271039 in words is "two hundred fifty-three million, two hundred seventy-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •