Base | Representation |
---|---|
bin | 110000100011110011… |
… | …100100111000100111 |
3 | 11222120202020020011011 |
4 | 300203303210320213 |
5 | 1323240411034120 |
6 | 35541500123051 |
7 | 3524041332316 |
oct | 604363447047 |
9 | 158522206134 |
10 | 52140330535 |
11 | 20126948067 |
12 | a131836487 |
13 | 4bbc30b9b7 |
14 | 2748ab827d |
15 | 1552726c5a |
hex | c23ce4e27 |
52140330535 has 4 divisors (see below), whose sum is σ = 62568396648. Its totient is φ = 41712264424.
The previous prime is 52140330533. The next prime is 52140330559. The reversal of 52140330535 is 53503304125.
52140330535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 52140330535 - 21 = 52140330533 is a prime.
It is a super-2 number, since 2×521403305352 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52140330497 and 52140330506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52140330533) 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, 5214033049 + ... + 5214033058.
It is an arithmetic number, because the mean of its divisors is an integer number (15642099162).
Almost surely, 252140330535 is an apocalyptic number.
52140330535 is a deficient number, since it is larger than the sum of its proper divisors (10428066113).
52140330535 is a wasteful number, since it uses less digits than its factorization.
52140330535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10428066112.
The product of its (nonzero) digits is 27000, while the sum is 31.
The spelling of 52140330535 in words is "fifty-two billion, one hundred forty million, three hundred thirty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •