Base | Representation |
---|---|
bin | 100110010001111010100… |
… | …0000011110001000001001 |
3 | 200121221221121212122220111 |
4 | 1030203311000132020021 |
5 | 1142144314012333000 |
6 | 15104534510154321 |
7 | 1052051133325141 |
oct | 114436500361011 |
9 | 20557847778814 |
10 | 5261150511625 |
11 | 1749272340178 |
12 | 70b7907b29a1 |
13 | 2c21802c8518 |
14 | 1428d9047921 |
15 | 91cc440acba |
hex | 4c8f501e209 |
5261150511625 has 16 divisors (see below), whose sum is σ = 6630924922128. Its totient is φ = 4167247920000.
The previous prime is 5261150511607. The next prime is 5261150511649.
5261150511625 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 8 ways, for example, as 4461705616 + 5256688806009 = 66796^2 + 2292747^2 .
It is a de Polignac number, because none of the positive numbers 2k-5261150511625 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 208349772 + ... + 208375021.
It is an arithmetic number, because the mean of its divisors is an integer number (414432807633).
Almost surely, 25261150511625 is an apocalyptic number.
It is an amenable number.
5261150511625 is a deficient number, since it is larger than the sum of its proper divisors (1369774410503).
5261150511625 is a wasteful number, since it uses less digits than its factorization.
5261150511625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416724909 (or 416724899 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 40.
It can be divided in two parts, 5261150 and 511625, that added together give a palindrome (5772775).
The spelling of 5261150511625 in words is "five trillion, two hundred sixty-one billion, one hundred fifty million, five hundred eleven thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •