Base | Representation |
---|---|
bin | 11000010001110000011000… |
… | …11110111001111000000000 |
3 | 21000000201021122002212002120 |
4 | 30020320030132321320000 |
5 | 23444141331121322443 |
6 | 305313253442444240 |
7 | 14150026012304430 |
oct | 1410701436717000 |
9 | 230021248085076 |
10 | 53386652917248 |
11 | 1601317486a362 |
12 | 5ba2836063680 |
13 | 23a34556180c1 |
14 | d27cdbbca2c0 |
15 | 628a9913b083 |
hex | 308e0c7b9e00 |
53386652917248 has 160 divisors (see below), whose sum is σ = 168148233538560. Its totient is φ = 14727352442880.
The previous prime is 53386652917243. The next prime is 53386652917271. The reversal of 53386652917248 is 84271925668335.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53386652917243) 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 15 ways as a sum of consecutive naturals, for example, 85296408 + ... + 85920023.
It is an arithmetic number, because the mean of its divisors is an integer number (1050926459616).
Almost surely, 253386652917248 is an apocalyptic number.
53386652917248 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
53386652917248 is an abundant number, since it is smaller than the sum of its proper divisors (114761580621312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53386652917248 is a wasteful number, since it uses less digits than its factorization.
53386652917248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171216488 (or 171216472 counting only the distinct ones).
The product of its digits is 522547200, while the sum is 69.
The spelling of 53386652917248 in words is "fifty-three trillion, three hundred eighty-six billion, six hundred fifty-two million, nine hundred seventeen thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •