Base | Representation |
---|---|
bin | 1001111011110011… |
… | …10111111111011101 |
3 | 111202201000100210122 |
4 | 10331321313333131 |
5 | 41410342032041 |
6 | 2241124244325 |
7 | 246112263413 |
oct | 47571677735 |
9 | 14681010718 |
10 | 5333549021 |
11 | 2297716359 |
12 | 104a2406a5 |
13 | 66cca4b88 |
14 | 3884c92b3 |
15 | 213390c4b |
hex | 13de77fdd |
5333549021 has 4 divisors (see below), whose sum is σ = 5346850044. Its totient is φ = 5320248000.
The previous prime is 5333548991. The next prime is 5333549057. The reversal of 5333549021 is 1209453335.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1209453335 = 5 ⋅241890667.
It can be written as a sum of positive squares in 2 ways, for example, as 4940121796 + 393427225 = 70286^2 + 19835^2 .
It is a cyclic number.
It is not a de Polignac number, because 5333549021 - 222 = 5329354717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5333540021) 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, 6649910 + ... + 6650711.
It is an arithmetic number, because the mean of its divisors is an integer number (1336712511).
Almost surely, 25333549021 is an apocalyptic number.
It is an amenable number.
5333549021 is a deficient number, since it is larger than the sum of its proper divisors (13301023).
5333549021 is a wasteful number, since it uses less digits than its factorization.
5333549021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13301022.
The product of its (nonzero) digits is 48600, while the sum is 35.
The square root of 5333549021 is about 73031.1510315975. The cubic root of 5333549021 is about 1747.1844817216.
The spelling of 5333549021 in words is "five billion, three hundred thirty-three million, five hundred forty-nine thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •