Base | Representation |
---|---|
bin | 10111101101110011011100… |
… | …10110100011101011110101 |
3 | 20211122121201212000220122120 |
4 | 23312321232112203223311 |
5 | 23313421423121041000 |
6 | 302525555152150153 |
7 | 13661544633400416 |
oct | 1366715626435365 |
9 | 224577655026576 |
10 | 52151344315125 |
11 | 15687296312960 |
12 | 5a23343838359 |
13 | 2313b09bb9423 |
14 | cc41d21c380d |
15 | 6068997626a0 |
hex | 2f6e6e5a3af5 |
52151344315125 has 64 divisors (see below), whose sum is σ = 94888565710848. Its totient is φ = 25226832360000.
The previous prime is 52151344315123. The next prime is 52151344315139.
52151344315125 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 52151344315125 - 21 = 52151344315123 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52151344315123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12888889 + ... + 16444638.
It is an arithmetic number, because the mean of its divisors is an integer number (1482633839232).
Almost surely, 252151344315125 is an apocalyptic number.
52151344315125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52151344315125 is a deficient number, since it is larger than the sum of its proper divisors (42737221395723).
52151344315125 is a wasteful number, since it uses less digits than its factorization.
52151344315125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29333987 (or 29333977 counting only the distinct ones).
The product of its digits is 360000, while the sum is 42.
The spelling of 52151344315125 in words is "fifty-two trillion, one hundred fifty-one billion, three hundred forty-four million, three hundred fifteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •