Base | Representation |
---|---|
bin | 11000001100101000100000… |
… | …11110000011000001110100 |
3 | 20222101212221000200012000012 |
4 | 30012110100132003001310 |
5 | 23433300330243023244 |
6 | 305100342454035352 |
7 | 14131224630354050 |
oct | 1406242036030164 |
9 | 228355830605005 |
10 | 53210626142324 |
11 | 15a55555293a72 |
12 | 5b746ab048b58 |
13 | 238c981bac211 |
14 | d1d59d974c60 |
15 | 6241e566989e |
hex | 306510783074 |
53210626142324 has 24 divisors (see below), whose sum is σ = 106507844096640. Its totient is φ = 22785998672736.
The previous prime is 53210626142291. The next prime is 53210626142329. The reversal of 53210626142324 is 42324162601235.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53210626142329) 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, 773106152 + ... + 773174975.
It is an arithmetic number, because the mean of its divisors is an integer number (4437826837360).
Almost surely, 253210626142324 is an apocalyptic number.
It is an amenable number.
53210626142324 is an abundant number, since it is smaller than the sum of its proper divisors (53297217954316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53210626142324 is a wasteful number, since it uses less digits than its factorization.
53210626142324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546282367 (or 1546282365 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 41.
Adding to 53210626142324 its reverse (42324162601235), we get a palindrome (95534788743559).
The spelling of 53210626142324 in words is "fifty-three trillion, two hundred ten billion, six hundred twenty-six million, one hundred forty-two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •