Base | Representation |
---|---|
bin | 1100011101011… |
… | …1000110000101 |
3 | 10122100010221222 |
4 | 3013113012011 |
5 | 101334330003 |
6 | 5104050125 |
7 | 1203133112 |
oct | 307270605 |
9 | 118303858 |
10 | 52261253 |
11 | 27555720 |
12 | 15603945 |
13 | aa9a725 |
14 | 6d25909 |
15 | 48c4c38 |
hex | 31d7185 |
52261253 has 8 divisors (see below), whose sum is σ = 57430080. Its totient is φ = 47162080.
The previous prime is 52261189. The next prime is 52261283. The reversal of 52261253 is 35216225.
52261253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52261253 - 26 = 52261189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52261283) 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 7 ways as a sum of consecutive naturals, for example, 15833 + ... + 18846.
It is an arithmetic number, because the mean of its divisors is an integer number (7178760).
Almost surely, 252261253 is an apocalyptic number.
It is an amenable number.
52261253 is a deficient number, since it is larger than the sum of its proper divisors (5168827).
52261253 is a wasteful number, since it uses less digits than its factorization.
52261253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34827.
The product of its digits is 3600, while the sum is 26.
The square root of 52261253 is about 7229.1944917812. The cubic root of 52261253 is about 373.8751549328.
Adding to 52261253 its reverse (35216225), we get a palindrome (87477478).
The spelling of 52261253 in words is "fifty-two million, two hundred sixty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •