Base | Representation |
---|---|
bin | 110000100100101110… |
… | …001011000100101111 |
3 | 11222121211010122011210 |
4 | 300210232023010233 |
5 | 1323303324110221 |
6 | 35543205245503 |
7 | 3524316030033 |
oct | 604456130457 |
9 | 158554118153 |
10 | 52155691311 |
11 | 20134589919 |
12 | a136a03893 |
13 | 4bc2559609 |
14 | 274ab561c3 |
15 | 1553c5d276 |
hex | c24b8b12f |
52155691311 has 8 divisors (see below), whose sum is σ = 69668055424. Its totient is φ = 34706894040.
The previous prime is 52155691303. The next prime is 52155691409. The reversal of 52155691311 is 11319655125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52155691311 - 23 = 52155691303 is a prime.
It is a super-2 number, since 2×521556913112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52155691311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52155691811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15889795 + ... + 15893076.
It is an arithmetic number, because the mean of its divisors is an integer number (8708506928).
Almost surely, 252155691311 is an apocalyptic number.
52155691311 is a deficient number, since it is larger than the sum of its proper divisors (17512364113).
52155691311 is a wasteful number, since it uses less digits than its factorization.
52155691311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31783421.
The product of its digits is 40500, while the sum is 39.
The spelling of 52155691311 in words is "fifty-two billion, one hundred fifty-five million, six hundred ninety-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •