Base | Representation |
---|---|
bin | 1001100101100101… |
… | …10111011010100001 |
3 | 111021201021221020202 |
4 | 10302302313122201 |
5 | 41020133143043 |
6 | 2210425314545 |
7 | 241360105001 |
oct | 46262673241 |
9 | 14251257222 |
10 | 5147162273 |
11 | 2201491220 |
12 | bb7935a55 |
13 | 6404a5c66 |
14 | 36b84c001 |
15 | 201d251b8 |
hex | 132cb76a1 |
5147162273 has 4 divisors (see below), whose sum is σ = 5615086128. Its totient is φ = 4679238420.
The previous prime is 5147162269. The next prime is 5147162297. The reversal of 5147162273 is 3722617415.
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.
It is a cyclic number.
It is not a de Polignac number, because 5147162273 - 22 = 5147162269 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5147162213) by changing a digit.
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, 233961911 + ... + 233961932.
It is an arithmetic number, because the mean of its divisors is an integer number (1403771532).
Almost surely, 25147162273 is an apocalyptic number.
It is an amenable number.
5147162273 is a deficient number, since it is larger than the sum of its proper divisors (467923855).
5147162273 is a wasteful number, since it uses less digits than its factorization.
5147162273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467923854.
The product of its digits is 70560, while the sum is 38.
The square root of 5147162273 is about 71743.7263668399. The cubic root of 5147162273 is about 1726.5902605081.
Adding to 5147162273 its reverse (3722617415), we get a palindrome (8869779688).
The spelling of 5147162273 in words is "five billion, one hundred forty-seven million, one hundred sixty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •