Base | Representation |
---|---|
bin | 1100100101000… |
… | …0000100001010 |
3 | 10200021022122120 |
4 | 3021100010022 |
5 | 102001203441 |
6 | 5122432110 |
7 | 1210265520 |
oct | 311200412 |
9 | 120238576 |
10 | 52756746 |
11 | 27863a19 |
12 | 15802636 |
13 | ac12113 |
14 | 7014310 |
15 | 4971966 |
hex | 325010a |
52756746 has 64 divisors (see below), whose sum is σ = 131196672. Its totient is φ = 13796352.
The previous prime is 52756741. The next prime is 52756789. The reversal of 52756746 is 64765725.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52756698 and 52756707.
It is not an unprimeable number, because it can be changed into a prime (52756741) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25420 + ... + 27416.
It is an arithmetic number, because the mean of its divisors is an integer number (2049948).
Almost surely, 252756746 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52756746, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65598336).
52756746 is an abundant number, since it is smaller than the sum of its proper divisors (78439926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52756746 is a wasteful number, since it uses less digits than its factorization.
52756746 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2063.
The product of its digits is 352800, while the sum is 42.
The square root of 52756746 is about 7263.3839221123. The cubic root of 52756746 is about 375.0530200589.
It can be divided in two parts, 5275 and 6746, that added together give a palindrome (12021).
The spelling of 52756746 in words is "fifty-two million, seven hundred fifty-six thousand, seven hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •