Base | Representation |
---|---|
bin | 100101101000011010010… |
… | …1010100010011001100101 |
3 | 200022102220020222102222102 |
4 | 1023100310222202121211 |
5 | 1134214301143044230 |
6 | 14555554535541445 |
7 | 1042444403153411 |
oct | 113206452423145 |
9 | 20272806872872 |
10 | 5172024190565 |
11 | 1714496903aa1 |
12 | 6b645852a885 |
13 | 2b69484b533b |
14 | 13c4821b3d41 |
15 | 8e809b0c045 |
hex | 4b434aa2665 |
5172024190565 has 4 divisors (see below), whose sum is σ = 6206429028684. Its totient is φ = 4137619352448.
The previous prime is 5172024190559. The next prime is 5172024190583. The reversal of 5172024190565 is 5650914202715.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1991843900929 + 3180180289636 = 1411327^2 + 1783306^2 .
It is a cyclic number.
It is not a de Polignac number, because 5172024190565 - 228 = 5171755755109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 517202419052 + ... + 517202419061.
It is an arithmetic number, because the mean of its divisors is an integer number (1551607257171).
Almost surely, 25172024190565 is an apocalyptic number.
It is an amenable number.
5172024190565 is a deficient number, since it is larger than the sum of its proper divisors (1034404838119).
5172024190565 is a wasteful number, since it uses less digits than its factorization.
5172024190565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034404838118.
The product of its (nonzero) digits is 756000, while the sum is 47.
The spelling of 5172024190565 in words is "five trillion, one hundred seventy-two billion, twenty-four million, one hundred ninety thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •