Base | Representation |
---|---|
bin | 101111100001110011… |
… | …011111111111101101 |
3 | 11212201120121201210000 |
4 | 233201303133333231 |
5 | 1314003422424003 |
6 | 35235542334513 |
7 | 3454434315054 |
oct | 574163377755 |
9 | 155646551700 |
10 | 51033014253 |
11 | 1a708895a41 |
12 | 9a82a2a439 |
13 | 4a73a98b70 |
14 | 26819d339b |
15 | 14da3e81a3 |
hex | be1cdffed |
51033014253 has 40 divisors (see below), whose sum is σ = 82945239608. Its totient is φ = 31081107456.
The previous prime is 51033014243. The next prime is 51033014267. The reversal of 51033014253 is 35241033015.
51033014253 is a `hidden beast` number, since 5 + 103 + 301 + 4 + 253 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1427479524 + 49605534729 = 37782^2 + 222723^2 .
It is not a de Polignac number, because 51033014253 - 26 = 51033014189 is a prime.
It is a super-2 number, since 2×510330142532 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51033014243) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 147676 + ... + 351957.
Almost surely, 251033014253 is an apocalyptic number.
It is an amenable number.
51033014253 is a deficient number, since it is larger than the sum of its proper divisors (31912225355).
51033014253 is a wasteful number, since it uses less digits than its factorization.
51033014253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 499755 (or 499746 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 51033014253 its reverse (35241033015), we get a palindrome (86274047268).
The spelling of 51033014253 in words is "fifty-one billion, thirty-three million, fourteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •