Base | Representation |
---|---|
bin | 1001110100101100… |
… | …11010000000111111 |
3 | 111121112210212112202 |
4 | 10322112122000333 |
5 | 41300110411201 |
6 | 2231154222115 |
7 | 244456401515 |
oct | 47226320077 |
9 | 14545725482 |
10 | 5273919551 |
11 | 2266a988aa |
12 | 103228493b |
13 | 660827774 |
14 | 3806064b5 |
15 | 20d012c6b |
hex | 13a59a03f |
5273919551 has 8 divisors (see below), whose sum is σ = 5310504960. Its totient is φ = 5237455608.
The previous prime is 5273919533. The next prime is 5273919559. The reversal of 5273919551 is 1559193725.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5273919551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5273919496 and 5273919505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5273919559) 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 7 ways as a sum of consecutive naturals, for example, 57650 + ... + 117776.
It is an arithmetic number, because the mean of its divisors is an integer number (663813120).
Almost surely, 25273919551 is an apocalyptic number.
5273919551 is a deficient number, since it is larger than the sum of its proper divisors (36585409).
5273919551 is a wasteful number, since it uses less digits than its factorization.
5273919551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60733.
The product of its digits is 425250, while the sum is 47.
The square root of 5273919551 is about 72621.7567330893. The cubic root of 5273919551 is about 1740.6488476120.
The spelling of 5273919551 in words is "five billion, two hundred seventy-three million, nine hundred nineteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •