Base | Representation |
---|---|
bin | 11000010001001011001001… |
… | …11010010000011111011100 |
3 | 20222221210200102000001212001 |
4 | 30020211210322100133130 |
5 | 23443324410340140200 |
6 | 305300150024252044 |
7 | 14145420424304602 |
oct | 1410454472203734 |
9 | 228853612001761 |
10 | 53366661646300 |
11 | 16005746262632 |
12 | 5b9a997011024 |
13 | 23a15ba9a86b2 |
14 | d26d62b37872 |
15 | 6282c904676a |
hex | 308964e907dc |
53366661646300 has 72 divisors (see below), whose sum is σ = 115984435021056. Its totient is φ = 21313734524160.
The previous prime is 53366661646213. The next prime is 53366661646301. The reversal of 53366661646300 is 364616666335.
It is a super-4 number, since 4×533666616463004 (a number of 56 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53366661646301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 175180914 + ... + 175485286.
It is an arithmetic number, because the mean of its divisors is an integer number (1610894930848).
Almost surely, 253366661646300 is an apocalyptic number.
53366661646300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
53366661646300 is an abundant number, since it is smaller than the sum of its proper divisors (62617773374756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53366661646300 is a wasteful number, since it uses less digits than its factorization.
53366661646300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307087 (or 307080 counting only the distinct ones).
The product of its (nonzero) digits is 25194240, while the sum is 55.
The spelling of 53366661646300 in words is "fifty-three trillion, three hundred sixty-six billion, six hundred sixty-one million, six hundred forty-six thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •