Base | Representation |
---|---|
bin | 110000101010011010… |
… | …001011000001011001 |
3 | 11222212110200111002100 |
4 | 300222122023001121 |
5 | 1324002241032023 |
6 | 40000454354013 |
7 | 3526555056036 |
oct | 605232130131 |
9 | 158773614070 |
10 | 52251111513 |
11 | 20183432497 |
12 | a16295b909 |
13 | 4c09258683 |
14 | 27596b438d |
15 | 155c30ac43 |
hex | c2a68b059 |
52251111513 has 12 divisors (see below), whose sum is σ = 75492743508. Its totient is φ = 34825344000.
The previous prime is 52251111433. The next prime is 52251111571. The reversal of 52251111513 is 31511115225.
It is a happy number.
52251111513 is a `hidden beast` number, since 5 + 22 + 511 + 115 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 26352002889 + 25899108624 = 162333^2 + 160932^2 .
It is not a de Polignac number, because 52251111513 - 29 = 52251111001 is a prime.
It is a super-2 number, since 2×522511115132 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52251111013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 689520 + ... + 761537.
It is an arithmetic number, because the mean of its divisors is an integer number (6291061959).
Almost surely, 252251111513 is an apocalyptic number.
It is an amenable number.
52251111513 is a deficient number, since it is larger than the sum of its proper divisors (23241631995).
52251111513 is a wasteful number, since it uses less digits than its factorization.
52251111513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455064 (or 1455061 counting only the distinct ones).
The product of its digits is 1500, while the sum is 27.
Adding to 52251111513 its reverse (31511115225), we get a palindrome (83762226738).
The spelling of 52251111513 in words is "fifty-two billion, two hundred fifty-one million, one hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •