Base | Representation |
---|---|
bin | 110000110100110011… |
… | …001001100111110101 |
3 | 12000022121200212012200 |
4 | 300310303021213311 |
5 | 1324331402302131 |
6 | 40030042535113 |
7 | 3534102546510 |
oct | 606463114765 |
9 | 160277625180 |
10 | 52425431541 |
11 | 2026287572a |
12 | a1b1207499 |
13 | 4c363c1112 |
14 | 27748cdd77 |
15 | 156c7912e6 |
hex | c34cc99f5 |
52425431541 has 24 divisors (see below), whose sum is σ = 91098496320. Its totient is φ = 28380684096.
The previous prime is 52425431491. The next prime is 52425431557. The reversal of 52425431541 is 14513452425.
52425431541 is a `hidden beast` number, since 52 + 4 + 25 + 43 + 1 + 541 = 666.
It is not a de Polignac number, because 52425431541 - 211 = 52425429493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52425431496 and 52425431505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52425431561) 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 23 ways as a sum of consecutive naturals, for example, 21897480 + ... + 21899873.
It is an arithmetic number, because the mean of its divisors is an integer number (3795770680).
Almost surely, 252425431541 is an apocalyptic number.
It is an amenable number.
52425431541 is a deficient number, since it is larger than the sum of its proper divisors (38673064779).
52425431541 is a wasteful number, since it uses less digits than its factorization.
52425431541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43797385 (or 43797382 counting only the distinct ones).
The product of its digits is 96000, while the sum is 36.
Adding to 52425431541 its reverse (14513452425), we get a palindrome (66938883966).
The spelling of 52425431541 in words is "fifty-two billion, four hundred twenty-five million, four hundred thirty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •