Base | Representation |
---|---|
bin | 110000110110011000… |
… | …101010110101101101 |
3 | 12000101110202220211112 |
4 | 300312120222311231 |
5 | 1324410210403031 |
6 | 40032433201405 |
7 | 3534545006330 |
oct | 606630526555 |
9 | 160343686745 |
10 | 52452044141 |
11 | 202768a2112 |
12 | a1ba100265 |
13 | 4c3ba7b313 |
14 | 277825a617 |
15 | 156ec9b62b |
hex | c3662ad6d |
52452044141 has 8 divisors (see below), whose sum is σ = 60527186304. Its totient is φ = 44522400240.
The previous prime is 52452044129. The next prime is 52452044167. The reversal of 52452044141 is 14144025425.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52452044141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52452044098 and 52452044107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52452044101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36373790 + ... + 36375231.
It is an arithmetic number, because the mean of its divisors is an integer number (7565898288).
Almost surely, 252452044141 is an apocalyptic number.
It is an amenable number.
52452044141 is a deficient number, since it is larger than the sum of its proper divisors (8075142163).
52452044141 is a wasteful number, since it uses less digits than its factorization.
52452044141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72749131.
The product of its (nonzero) digits is 25600, while the sum is 32.
Adding to 52452044141 its reverse (14144025425), we get a palindrome (66596069566).
The spelling of 52452044141 in words is "fifty-two billion, four hundred fifty-two million, forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •