Base | Representation |
---|---|
bin | 110000111111100001… |
… | …000100010000010000 |
3 | 12000210011001002111200 |
4 | 300333201010100100 |
5 | 1330213420142321 |
6 | 40055544511200 |
7 | 3541415110425 |
oct | 607741042020 |
9 | 160704032450 |
10 | 52605240336 |
11 | 20345317740 |
12 | a24147b500 |
13 | 4c64728c5c |
14 | 2790737d4c |
15 | 157d45cd26 |
hex | c3f844410 |
52605240336 has 60 divisors (see below), whose sum is σ = 160605397680. Its totient is φ = 15940981440.
The previous prime is 52605240319. The next prime is 52605240421. The reversal of 52605240336 is 63304250625.
52605240336 is a `hidden beast` number, since 5 + 2 + 605 + 2 + 40 + 3 + 3 + 6 = 666.
It is a super-2 number, since 2×526052403362 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 52605240336.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16603606 + ... + 16606773.
It is an arithmetic number, because the mean of its divisors is an integer number (2676756628).
Almost surely, 252605240336 is an apocalyptic number.
It is an amenable number.
52605240336 is an abundant number, since it is smaller than the sum of its proper divisors (108000157344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52605240336 is a wasteful number, since it uses less digits than its factorization.
52605240336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33210404 (or 33210395 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
The spelling of 52605240336 in words is "fifty-two billion, six hundred five million, two hundred forty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •