Base | Representation |
---|---|
bin | 1001101010001001… |
… | …01000000110010001 |
3 | 111101101012012220121 |
4 | 10311010220012101 |
5 | 41104423410221 |
6 | 2214312310241 |
7 | 242332640155 |
oct | 46504500621 |
9 | 14341165817 |
10 | 5185372561 |
11 | 222100a176 |
12 | 10086a2381 |
13 | 648393cb5 |
14 | 372957065 |
15 | 205371a41 |
hex | 135128191 |
5185372561 has 4 divisors (see below), whose sum is σ = 5185518912. Its totient is φ = 5185226212.
The previous prime is 5185372559. The next prime is 5185372567. The reversal of 5185372561 is 1652735815.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1652735815 = 5 ⋅330547163.
It is a cyclic number.
It is not a de Polignac number, because 5185372561 - 21 = 5185372559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5185372567) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17076 + ... + 103258.
It is an arithmetic number, because the mean of its divisors is an integer number (1296379728).
Almost surely, 25185372561 is an apocalyptic number.
It is an amenable number.
5185372561 is a deficient number, since it is larger than the sum of its proper divisors (146351).
5185372561 is an equidigital number, since it uses as much as digits as its factorization.
5185372561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146350.
The product of its digits is 252000, while the sum is 43.
The square root of 5185372561 is about 72009.5310427724. The cubic root of 5185372561 is about 1730.8522159143.
The spelling of 5185372561 in words is "five billion, one hundred eighty-five million, three hundred seventy-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •