Base | Representation |
---|---|
bin | 110001100100011010… |
… | …110010101001010101 |
3 | 12002101022000020111221 |
4 | 301210122302221111 |
5 | 1333000413233331 |
6 | 40241222330341 |
7 | 3562643346616 |
oct | 614432625125 |
9 | 162338006457 |
10 | 53224352341 |
11 | 20632839756 |
12 | a3948899b1 |
13 | 5032a86a14 |
14 | 280ca57c0d |
15 | 15b79a3711 |
hex | c646b2a55 |
53224352341 has 8 divisors (see below), whose sum is σ = 54636414080. Its totient is φ = 51830749152.
The previous prime is 53224352323. The next prime is 53224352411. The reversal of 53224352341 is 14325342235.
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 53224352341 - 225 = 53190797909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53224352297 and 53224352306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53224350341) 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, 4608795 + ... + 4620328.
It is an arithmetic number, because the mean of its divisors is an integer number (6829551760).
Almost surely, 253224352341 is an apocalyptic number.
It is an amenable number.
53224352341 is a deficient number, since it is larger than the sum of its proper divisors (1412061739).
53224352341 is an equidigital number, since it uses as much as digits as its factorization.
53224352341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9229275.
The product of its digits is 86400, while the sum is 34.
Adding to 53224352341 its reverse (14325342235), we get a palindrome (67549694576).
The spelling of 53224352341 in words is "fifty-three billion, two hundred twenty-four million, three hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •