Base | Representation |
---|---|
bin | 1100100001101… |
… | …1011101010111 |
3 | 10122212101002000 |
4 | 3020123131113 |
5 | 101422310041 |
6 | 5114050343 |
7 | 1205410356 |
oct | 310333527 |
9 | 118771060 |
10 | 52541271 |
11 | 27727042 |
12 | 157199b3 |
13 | ab68013 |
14 | 6d9999d |
15 | 492cbb6 |
hex | 321b757 |
52541271 has 32 divisors (see below), whose sum is σ = 83229120. Its totient is φ = 32643072.
The previous prime is 52541261. The next prime is 52541299. The reversal of 52541271 is 17214525.
52541271 is a `hidden beast` number, since 52 + 541 + 2 + 71 = 666.
It is not a de Polignac number, because 52541271 - 29 = 52540759 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52541201) 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, 51361 + ... + 52373.
It is an arithmetic number, because the mean of its divisors is an integer number (2600910).
Almost surely, 252541271 is an apocalyptic number.
52541271 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
52541271 is a deficient number, since it is larger than the sum of its proper divisors (30687849).
52541271 is a wasteful number, since it uses less digits than its factorization.
52541271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152 (or 1146 counting only the distinct ones).
The product of its digits is 2800, while the sum is 27.
The square root of 52541271 is about 7248.5357831772. The cubic root of 52541271 is about 374.5417121542.
Adding to 52541271 its reverse (17214525), we get a palindrome (69755796).
The spelling of 52541271 in words is "fifty-two million, five hundred forty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •