Base | Representation |
---|---|
bin | 1010010011010010… |
… | …11000100110110001 |
3 | 112021102201012010011 |
4 | 11021221120212301 |
5 | 42311310142003 |
6 | 2312442534521 |
7 | 254023631335 |
oct | 51151304661 |
9 | 15242635104 |
10 | 5530552753 |
11 | 2388942160 |
12 | 10a4207441 |
13 | 6a1a5042b |
14 | 3a672b7c5 |
15 | 22580746d |
hex | 149a589b1 |
5530552753 has 4 divisors (see below), whose sum is σ = 6033330288. Its totient is φ = 5027775220.
The previous prime is 5530552751. The next prime is 5530552759. The reversal of 5530552753 is 3572550355.
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 5530552753 - 21 = 5530552751 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5530552751) 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, 251388751 + ... + 251388772.
It is an arithmetic number, because the mean of its divisors is an integer number (1508332572).
Almost surely, 25530552753 is an apocalyptic number.
It is an amenable number.
5530552753 is a deficient number, since it is larger than the sum of its proper divisors (502777535).
5530552753 is a wasteful number, since it uses less digits than its factorization.
5530552753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502777534.
The product of its (nonzero) digits is 393750, while the sum is 40.
The square root of 5530552753 is about 74367.6862151835. The cubic root of 5530552753 is about 1768.4366752065.
The spelling of 5530552753 in words is "five billion, five hundred thirty million, five hundred fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •