Base | Representation |
---|---|
bin | 11000010011001101110100… |
… | …11001110110101100111000 |
3 | 21000012111202112210112022022 |
4 | 30021212322121312230320 |
5 | 24001002044230004433 |
6 | 305352311212214012 |
7 | 14153453050046162 |
oct | 1411467231665470 |
9 | 230174675715268 |
10 | 53436815469368 |
11 | 16032476268201 |
12 | 5bb04b546a308 |
13 | 23a80bac600c6 |
14 | d2a4d9d51932 |
15 | 62a032dde698 |
hex | 3099ba676b38 |
53436815469368 has 64 divisors (see below), whose sum is σ = 110791549440000. Its totient is φ = 24049151862912.
The previous prime is 53436815469337. The next prime is 53436815469379. The reversal of 53436815469368 is 86396451863435.
It is a super-4 number, since 4×534368154693684 (a number of 56 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a hoax number, since the sum of its digits (71) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50771480 + ... + 51813287.
It is an arithmetic number, because the mean of its divisors is an integer number (1731117960000).
Almost surely, 253436815469368 is an apocalyptic number.
It is an amenable number.
53436815469368 is an abundant number, since it is smaller than the sum of its proper divisors (57354733970632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53436815469368 is a wasteful number, since it uses less digits than its factorization.
53436815469368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102584964 (or 102584960 counting only the distinct ones).
The product of its digits is 1343692800, while the sum is 71.
The spelling of 53436815469368 in words is "fifty-three trillion, four hundred thirty-six billion, eight hundred fifteen million, four hundred sixty-nine thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •