Base | Representation |
---|---|
bin | 100110010111010110100… |
… | …1100100001000010000001 |
3 | 200200002002122001012220022 |
4 | 1030232231030201002001 |
5 | 1142342224114032320 |
6 | 15114145511223225 |
7 | 1052643441460535 |
oct | 114565514410201 |
9 | 20602078035808 |
10 | 5272830611585 |
11 | 1753216466149 |
12 | 711ab0377b15 |
13 | 2c32c20b5484 |
14 | 1432c6391bc5 |
15 | 92259a3b325 |
hex | 4cbad321081 |
5272830611585 has 4 divisors (see below), whose sum is σ = 6327396733908. Its totient is φ = 4218264489264.
The previous prime is 5272830611567. The next prime is 5272830611597. The reversal of 5272830611585 is 5851160382725.
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 4136696328769 + 1136134282816 = 2033887^2 + 1065896^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5272830611585 is a prime.
It is a Duffinian number.
It is a Curzon 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 3 ways as a sum of consecutive naturals, for example, 527283061154 + ... + 527283061163.
It is an arithmetic number, because the mean of its divisors is an integer number (1581849183477).
Almost surely, 25272830611585 is an apocalyptic number.
It is an amenable number.
5272830611585 is a deficient number, since it is larger than the sum of its proper divisors (1054566122323).
5272830611585 is a wasteful number, since it uses less digits than its factorization.
5272830611585 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1054566122322.
The product of its (nonzero) digits is 4032000, while the sum is 53.
The spelling of 5272830611585 in words is "five trillion, two hundred seventy-two billion, eight hundred thirty million, six hundred eleven thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •