Base | Representation |
---|---|
bin | 1100011011000… |
… | …1010001110011 |
3 | 10122001021111000 |
4 | 3012301101303 |
5 | 101314400410 |
6 | 5100453043 |
7 | 1201616400 |
oct | 306612163 |
9 | 118037430 |
10 | 52106355 |
11 | 2745a304 |
12 | 1554a183 |
13 | aa45082 |
14 | 6cc52a7 |
15 | 4893dc0 |
hex | 31b1473 |
52106355 has 48 divisors (see below), whose sum is σ = 107771040. Its totient is φ = 23817024.
The previous prime is 52106347. The next prime is 52106357. The reversal of 52106355 is 55360125.
52106355 is a `hidden beast` number, since 5 + 21 + 0 + 635 + 5 = 666.
52106355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52106355 - 23 = 52106347 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (52106357) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 2677 + ... + 10553.
It is an arithmetic number, because the mean of its divisors is an integer number (2245230).
Almost surely, 252106355 is an apocalyptic number.
52106355 is an abundant number, since it is smaller than the sum of its proper divisors (55664685).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52106355 is a wasteful number, since it uses less digits than its factorization.
52106355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7905 (or 7892 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 52106355 is about 7218.4731765104. The cubic root of 52106355 is about 373.5054111247.
The spelling of 52106355 in words is "fifty-two million, one hundred six thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •