Base | Representation |
---|---|
bin | 11110001010010… |
… | …00110000000101 |
3 | 122122001222100100 |
4 | 33011020300011 |
5 | 1004232123210 |
6 | 41034434313 |
7 | 6161335224 |
oct | 1705106005 |
9 | 578058310 |
10 | 253004805 |
11 | 11a8a6289 |
12 | 70892999 |
13 | 405552b1 |
14 | 2585ccbb |
15 | 173295c0 |
hex | f148c05 |
253004805 has 24 divisors (see below), whose sum is σ = 442573560. Its totient is φ = 133695360.
The previous prime is 253004783. The next prime is 253004827. The reversal of 253004805 is 508400352.
It is an interprime number because it is at equal distance from previous prime (253004783) and next prime (253004827).
It can be written as a sum of positive squares in 4 ways, for example, as 1052676 + 251952129 = 1026^2 + 15873^2 .
It is not a de Polignac number, because 253004805 - 27 = 253004677 is a prime.
It is a super-2 number, since 2×2530048052 = 128022862706176050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20886 + ... + 30695.
It is an arithmetic number, because the mean of its divisors is an integer number (18440565).
Almost surely, 2253004805 is an apocalyptic number.
It is an amenable number.
253004805 is a deficient number, since it is larger than the sum of its proper divisors (189568755).
253004805 is a wasteful number, since it uses less digits than its factorization.
253004805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51701 (or 51698 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 253004805 is about 15906.1247637506. The cubic root of 253004805 is about 632.4743582954.
The spelling of 253004805 in words is "two hundred fifty-three million, four thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •