Base | Representation |
---|---|
bin | 110000011101000001… |
… | …011110010100010111 |
3 | 11222021211002201110221 |
4 | 300131001132110113 |
5 | 1323022243030033 |
6 | 35522313055211 |
7 | 3521160143434 |
oct | 603501362427 |
9 | 158254081427 |
10 | 52026533143 |
11 | 20078692432 |
12 | a0bb6b7507 |
13 | 4ba1877070 |
14 | 2737934b8b |
15 | 154774912d |
hex | c1d05e517 |
52026533143 has 8 divisors (see below), whose sum is σ = 56032567808. Its totient is φ = 48021069024.
The previous prime is 52026533137. The next prime is 52026533149. The reversal of 52026533143 is 34133562025.
It is an interprime number because it is at equal distance from previous prime (52026533137) and next prime (52026533149).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52026533143 - 225 = 51992978711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52026533099 and 52026533108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52026533149) 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 7 ways as a sum of consecutive naturals, for example, 57130 + ... + 327592.
It is an arithmetic number, because the mean of its divisors is an integer number (7004070976).
Almost surely, 252026533143 is an apocalyptic number.
52026533143 is a deficient number, since it is larger than the sum of its proper divisors (4006034665).
52026533143 is a wasteful number, since it uses less digits than its factorization.
52026533143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285273.
The product of its (nonzero) digits is 64800, while the sum is 34.
The spelling of 52026533143 in words is "fifty-two billion, twenty-six million, five hundred thirty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •