Base | Representation |
---|---|
bin | 1100100000011… |
… | …0101011001101 |
3 | 10122201001022001 |
4 | 3020012223031 |
5 | 101412044031 |
6 | 5112152301 |
7 | 1204604233 |
oct | 310065315 |
9 | 118631261 |
10 | 52456141 |
11 | 27679091 |
12 | 15698691 |
13 | ab3834a |
14 | 6d76953 |
15 | 4912861 |
hex | 3206acd |
52456141 has 4 divisors (see below), whose sum is σ = 52937500. Its totient is φ = 51974784.
The previous prime is 52456111. The next prime is 52456147. The reversal of 52456141 is 14165425.
52456141 = T395 + T396 + ... + T721.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23522500 + 28933641 = 4850^2 + 5379^2 .
It is a cyclic number.
It is not a de Polignac number, because 52456141 - 29 = 52455629 is a prime.
It is a super-2 number, since 2×524561412 = 5503293457223762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52456147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240516 + ... + 240733.
It is an arithmetic number, because the mean of its divisors is an integer number (13234375).
Almost surely, 252456141 is an apocalyptic number.
It is an amenable number.
52456141 is a deficient number, since it is larger than the sum of its proper divisors (481359).
52456141 is a wasteful number, since it uses less digits than its factorization.
52456141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481358.
The product of its digits is 4800, while the sum is 28.
The square root of 52456141 is about 7242.6611821899. The cubic root of 52456141 is about 374.3393190558.
It can be divided in two parts, 524 and 56141, that added together give a palindrome (56665).
The spelling of 52456141 in words is "fifty-two million, four hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •