Base | Representation |
---|---|
bin | 10111110110010111011000… |
… | …01100011010001010101000 |
3 | 20212200202000222222201202020 |
4 | 23323023230030122022220 |
5 | 23333231402410010130 |
6 | 303313045231504440 |
7 | 14022030466125033 |
oct | 1373135414321250 |
9 | 225622028881666 |
10 | 52445513360040 |
11 | 15790021049309 |
12 | 5a70360388120 |
13 | 233578a988948 |
14 | cd453ab5c01a |
15 | 60e36507ae10 |
hex | 2fb2ec31a2a8 |
52445513360040 has 128 divisors (see below), whose sum is σ = 163579600033920. Its totient is φ = 13440713932800.
The previous prime is 52445513360003. The next prime is 52445513360069. The reversal of 52445513360040 is 4006331554425.
52445513360040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 52445513359974 and 52445513360001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79220041 + ... + 79879320.
It is an arithmetic number, because the mean of its divisors is an integer number (1277965625265).
Almost surely, 252445513360040 is an apocalyptic number.
It is an amenable number.
52445513360040 is an abundant number, since it is smaller than the sum of its proper divisors (111134086673880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52445513360040 is a wasteful number, since it uses less digits than its factorization.
52445513360040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159099483 (or 159099479 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 52445513360040 in words is "fifty-two trillion, four hundred forty-five billion, five hundred thirteen million, three hundred sixty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •