Base | Representation |
---|---|
bin | 1100011101100… |
… | …1111000010100 |
3 | 10122100201121110 |
4 | 3013121320110 |
5 | 101340211120 |
6 | 5104215020 |
7 | 1203211266 |
oct | 307317024 |
9 | 118321543 |
10 | 52272660 |
11 | 27563250 |
12 | 1560a470 |
13 | aaa298b |
14 | 6d29b36 |
15 | 48c82e0 |
hex | 31d9e14 |
52272660 has 48 divisors (see below), whose sum is σ = 159671232. Its totient is φ = 12672000.
The previous prime is 52272631. The next prime is 52272673. The reversal of 52272660 is 6627225.
52272660 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 38941 + ... + 40260.
It is an arithmetic number, because the mean of its divisors is an integer number (3326484).
Almost surely, 252272660 is an apocalyptic number.
It is an amenable number.
52272660 is an abundant number, since it is smaller than the sum of its proper divisors (107398572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52272660 is a wasteful number, since it uses less digits than its factorization.
52272660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79224 (or 79222 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 52272660 is about 7229.9834024706. The cubic root of 52272660 is about 373.9023547120.
Adding to 52272660 its reverse (6627225), we get a palindrome (58899885).
It can be divided in two parts, 5227 and 2660, that added together give a palindrome (7887).
The spelling of 52272660 in words is "fifty-two million, two hundred seventy-two thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •