Base | Representation |
---|---|
bin | 1001101001110100… |
… | …01010111111011001 |
3 | 111101012000222102112 |
4 | 10310322022333121 |
5 | 41103223210042 |
6 | 2214133442105 |
7 | 242300433662 |
oct | 46472127731 |
9 | 14335028375 |
10 | 5182631897 |
11 | 221a508063 |
12 | 10077a0335 |
13 | 6479446c1 |
14 | 372442369 |
15 | 204ece982 |
hex | 134e8afd9 |
5182631897 has 4 divisors (see below), whose sum is σ = 5182852560. Its totient is φ = 5182411236.
The previous prime is 5182631873. The next prime is 5182631911. The reversal of 5182631897 is 7981362815.
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 an emirpimes, since its reverse is a distinct semiprime: 7981362815 = 5 ⋅1596272563.
It is a cyclic number.
It is not a de Polignac number, because 5182631897 - 26 = 5182631833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5182631827) by changing a digit.
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, 70247 + ... + 123692.
It is an arithmetic number, because the mean of its divisors is an integer number (1295713140).
Almost surely, 25182631897 is an apocalyptic number.
It is an amenable number.
5182631897 is a deficient number, since it is larger than the sum of its proper divisors (220663).
5182631897 is a wasteful number, since it uses less digits than its factorization.
5182631897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220662.
The product of its digits is 725760, while the sum is 50.
The square root of 5182631897 is about 71990.4986578090. The cubic root of 5182631897 is about 1730.5472220567.
The spelling of 5182631897 in words is "five billion, one hundred eighty-two million, six hundred thirty-one thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •