Base | Representation |
---|---|
bin | 1100100011010… |
… | …1001010101000 |
3 | 10200001201111220 |
4 | 3020311022220 |
5 | 101434142233 |
6 | 5120222040 |
7 | 1206326352 |
oct | 310651250 |
9 | 120051456 |
10 | 52646568 |
11 | 27799167 |
12 | 1576a920 |
13 | aba3c20 |
14 | 6dc60d2 |
15 | 494deb3 |
hex | 32352a8 |
52646568 has 128 divisors (see below), whose sum is σ = 152409600. Its totient is φ = 15019776.
The previous prime is 52646557. The next prime is 52646621. The reversal of 52646568 is 86564625.
It is a super-2 number, since 2×526465682 = 5543322244357248, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 491971 + ... + 492077.
It is an arithmetic number, because the mean of its divisors is an integer number (1190700).
Almost surely, 252646568 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 52646568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76204800).
52646568 is an abundant number, since it is smaller than the sum of its proper divisors (99763032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52646568 is a wasteful number, since it uses less digits than its factorization.
52646568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231 (or 227 counting only the distinct ones).
The product of its digits is 345600, while the sum is 42.
The square root of 52646568 is about 7255.7954767207. The cubic root of 52646568 is about 374.7917492613.
The spelling of 52646568 in words is "fifty-two million, six hundred forty-six thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •