Base | Representation |
---|---|
bin | 11000000111001011001110… |
… | …10000100000111011001011 |
3 | 20221201221220021000122100102 |
4 | 30003211213100200323023 |
5 | 23422212304013322111 |
6 | 304434251052200015 |
7 | 14111535636445646 |
oct | 1403454720407313 |
9 | 227657807018312 |
10 | 53023103651531 |
11 | 15992a7677a152 |
12 | 5b4429616900b |
13 | 23780989338b0 |
14 | d14490a90a5d |
15 | 61e3bc83a13b |
hex | 303967420ecb |
53023103651531 has 4 divisors (see below), whose sum is σ = 57101803932432. Its totient is φ = 48944403370632.
The previous prime is 53023103651521. The next prime is 53023103651543. The reversal of 53023103651531 is 13515630132035.
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 53023103651531 - 230 = 53022029909707 is a prime.
It is a super-2 number, since 2×530231036515312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53023103651521) 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, 2039350140431 + ... + 2039350140456.
It is an arithmetic number, because the mean of its divisors is an integer number (14275450983108).
Almost surely, 253023103651531 is an apocalyptic number.
53023103651531 is a deficient number, since it is larger than the sum of its proper divisors (4078700280901).
53023103651531 is a wasteful number, since it uses less digits than its factorization.
53023103651531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4078700280900.
The product of its (nonzero) digits is 121500, while the sum is 38.
Adding to 53023103651531 its reverse (13515630132035), we get a palindrome (66538733783566).
The spelling of 53023103651531 in words is "fifty-three trillion, twenty-three billion, one hundred three million, six hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •