Base | Representation |
---|---|
bin | 1110101111110110011… |
… | …01100100101110000101 |
3 | 1210102221121000102100100 |
4 | 13113323031210232011 |
5 | 31300233302010000 |
6 | 1024441524434313 |
7 | 51416065226100 |
oct | 7277315445605 |
9 | 1712847012310 |
10 | 506725813125 |
11 | 1859a0569444 |
12 | 82259548999 |
13 | 38a266c325c |
14 | 1a7505a9737 |
15 | d2ab33ba00 |
hex | 75fb364b85 |
506725813125 has 90 divisors (see below), whose sum is σ = 1063956567102. Its totient is φ = 231645960000.
The previous prime is 506725813109. The next prime is 506725813219. The reversal of 506725813125 is 521318527605.
506725813125 is a `hidden beast` number, since 5 + 0 + 67 + 2 + 581 + 3 + 1 + 2 + 5 = 666.
It can be written as a sum of positive squares in 5 ways, for example, as 155502458244 + 351223354881 = 394338^2 + 592641^2 .
It is not a de Polignac number, because 506725813125 - 24 = 506725813109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 643606 + ... + 1194855.
Almost surely, 2506725813125 is an apocalyptic number.
It is an amenable number.
506725813125 is an abundant number, since it is smaller than the sum of its proper divisors (557230753977).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506725813125 is a wasteful number, since it uses less digits than its factorization.
506725813125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838501 (or 1838476 counting only the distinct ones).
The product of its (nonzero) digits is 504000, while the sum is 45.
The spelling of 506725813125 in words is "five hundred six billion, seven hundred twenty-five million, eight hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •