Base | Representation |
---|---|
bin | 1010011110110011… |
… | …00000110101110001 |
3 | 112112011022000221222 |
4 | 11033121200311301 |
5 | 43011011233343 |
6 | 2330211154425 |
7 | 256305116354 |
oct | 51731406561 |
9 | 15464260858 |
10 | 5627055473 |
11 | 2428365076 |
12 | 11105a5a15 |
13 | 6b8a3b130 |
14 | 3b548c29b |
15 | 22e01aa68 |
hex | 14f660d71 |
5627055473 has 4 divisors (see below), whose sum is σ = 6059905908. Its totient is φ = 5194205040.
The previous prime is 5627055443. The next prime is 5627055491. The reversal of 5627055473 is 3745507265.
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 2257485169 + 3369570304 = 47513^2 + 58048^2 .
It is a cyclic number.
It is not a de Polignac number, because 5627055473 - 210 = 5627054449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5627055433) 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, 216425198 + ... + 216425223.
It is an arithmetic number, because the mean of its divisors is an integer number (1514976477).
Almost surely, 25627055473 is an apocalyptic number.
It is an amenable number.
5627055473 is a deficient number, since it is larger than the sum of its proper divisors (432850435).
5627055473 is a wasteful number, since it uses less digits than its factorization.
5627055473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432850434.
The product of its (nonzero) digits is 882000, while the sum is 44.
The square root of 5627055473 is about 75013.7019017193. The cubic root of 5627055473 is about 1778.6632509946.
The spelling of 5627055473 in words is "five billion, six hundred twenty-seven million, fifty-five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •