Base | Representation |
---|---|
bin | 10111111000001100100111… |
… | …01110100010001101000000 |
3 | 20212220202111102020101120000 |
4 | 23330012103232202031000 |
5 | 23340244303113034242 |
6 | 303402014532320000 |
7 | 14026416300530340 |
oct | 1374062356421500 |
9 | 225822442211500 |
10 | 52508453643072 |
11 | 1580478a209549 |
12 | 5a805a6a73000 |
13 | 233b6ab61c17b |
14 | cd75cbd10d20 |
15 | 610cea9c8a4c |
hex | 2fc193ba2340 |
52508453643072 has 280 divisors, whose sum is σ = 179185900833984. Its totient is φ = 14892907235328.
The previous prime is 52508453643053. The next prime is 52508453643101. The reversal of 52508453643072 is 27034635480525.
52508453643072 is a `hidden beast` number, since 5 + 2 + 5 + 0 + 8 + 4 + 536 + 4 + 30 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 309538 + ... + 10252449.
Almost surely, 252508453643072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52508453643072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89592950416992).
52508453643072 is an abundant number, since it is smaller than the sum of its proper divisors (126677447190912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52508453643072 is a wasteful number, since it uses less digits than its factorization.
52508453643072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10562155 (or 10562136 counting only the distinct ones).
The product of its (nonzero) digits is 24192000, while the sum is 54.
The spelling of 52508453643072 in words is "fifty-two trillion, five hundred eight billion, four hundred fifty-three million, six hundred forty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •