Base | Representation |
---|---|
bin | 10111111100110001000100… |
… | …01010001110111000100000 |
3 | 20220110202202121022222000000 |
4 | 23332120202022032320200 |
5 | 23400332331243410141 |
6 | 304002102420300000 |
7 | 14043645150365265 |
oct | 1376304212167040 |
9 | 226422677288000 |
10 | 52665462091296 |
11 | 1586532a40156a |
12 | 5aa6b04841600 |
13 | 2350440b719c2 |
14 | d010443bb26c |
15 | 614e399e05b6 |
hex | 2fe62228ee20 |
52665462091296 has 168 divisors, whose sum is σ = 155475248745600. Its totient is φ = 17553045638016.
The previous prime is 52665462091189. The next prime is 52665462091499. The reversal of 52665462091296 is 69219026456625.
52665462091296 is a `hidden beast` number, since 5 + 2 + 6 + 65 + 462 + 0 + 91 + 29 + 6 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 200466201 + ... + 200728743.
It is an arithmetic number, because the mean of its divisors is an integer number (925447909200).
Almost surely, 252665462091296 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 52665462091296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77737624372800).
52665462091296 is an abundant number, since it is smaller than the sum of its proper divisors (102809786654304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52665462091296 is an equidigital number, since it uses as much as digits as its factorization.
52665462091296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271170 (or 271147 counting only the distinct ones).
The product of its (nonzero) digits is 83980800, while the sum is 63.
The spelling of 52665462091296 in words is "fifty-two trillion, six hundred sixty-five billion, four hundred sixty-two million, ninety-one thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •