Base | Representation |
---|---|
bin | 110001011010000101… |
… | …100001000101011111 |
3 | 12001221012211012020112 |
4 | 301122011201011133 |
5 | 1332122024100411 |
6 | 40212111040235 |
7 | 3555440041622 |
oct | 613205410537 |
9 | 161835735215 |
10 | 53051003231 |
11 | 205539a9a26 |
12 | a34681007b |
13 | 5005ba1195 |
14 | 27d3a11db9 |
15 | 15a7660b8b |
hex | c5a16115f |
53051003231 has 4 divisors (see below), whose sum is σ = 54880348200. Its totient is φ = 51221658264.
The previous prime is 53051003191. The next prime is 53051003237. The reversal of 53051003231 is 13230015035.
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 53051003231 - 26 = 53051003167 is a prime.
It is a super-2 number, since 2×530510032312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53051003197 and 53051003206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53051003237) 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 3 ways as a sum of consecutive naturals, for example, 914672441 + ... + 914672498.
It is an arithmetic number, because the mean of its divisors is an integer number (13720087050).
Almost surely, 253051003231 is an apocalyptic number.
53051003231 is a deficient number, since it is larger than the sum of its proper divisors (1829344969).
53051003231 is a wasteful number, since it uses less digits than its factorization.
53051003231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1829344968.
The product of its (nonzero) digits is 1350, while the sum is 23.
Adding to 53051003231 its reverse (13230015035), we get a palindrome (66281018266).
The spelling of 53051003231 in words is "fifty-three billion, fifty-one million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •