Base | Representation |
---|---|
bin | 1110101110100010011… |
… | …1110011100011100101 |
3 | 220012001202112222200212 |
4 | 3223220213303203211 |
5 | 13121131234231234 |
6 | 312122004345205 |
7 | 24164562521063 |
oct | 3535047634345 |
9 | 805052488625 |
10 | 253010852069 |
11 | 98335036a48 |
12 | 410509a5205 |
13 | 1ab21aa2a71 |
14 | c362641033 |
15 | 68ac3035ce |
hex | 3ae89f38e5 |
253010852069 has 4 divisors (see below), whose sum is σ = 259848983244. Its totient is φ = 246172720896.
The previous prime is 253010852009. The next prime is 253010852071. The reversal of 253010852069 is 960258010352.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 130276239844 + 122734612225 = 360938^2 + 350335^2 .
It is a cyclic number.
It is not a de Polignac number, because 253010852069 - 216 = 253010786533 is a prime.
It is a super-3 number, since 3×2530108520693 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253010852009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3419065532 + ... + 3419065605.
It is an arithmetic number, because the mean of its divisors is an integer number (64962245811).
Almost surely, 2253010852069 is an apocalyptic number.
It is an amenable number.
253010852069 is a deficient number, since it is larger than the sum of its proper divisors (6838131175).
253010852069 is an equidigital number, since it uses as much as digits as its factorization.
253010852069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6838131174.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 253010852069 in words is "two hundred fifty-three billion, ten million, eight hundred fifty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •