Base | Representation |
---|---|
bin | 1001111011110100… |
… | …10011100110101001 |
3 | 111202201020002221112 |
4 | 10331322103212221 |
5 | 41410404141441 |
6 | 2241130520105 |
7 | 246113244224 |
oct | 47572234651 |
9 | 14681202845 |
10 | 5333662121 |
11 | 2297793327 |
12 | 104a296035 |
13 | 6700144b8 |
14 | 3885185bb |
15 | 2133b44eb |
hex | 13de939a9 |
5333662121 has 8 divisors (see below), whose sum is σ = 5623552320. Its totient is φ = 5044689072.
The previous prime is 5333662109. The next prime is 5333662133. The reversal of 5333662121 is 1212663335.
It is an interprime number because it is at equal distance from previous prime (5333662109) and next prime (5333662133).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5333662121 - 26 = 5333662057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5333662151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217325 + ... + 240618.
It is an arithmetic number, because the mean of its divisors is an integer number (702944040).
Almost surely, 25333662121 is an apocalyptic number.
It is an amenable number.
5333662121 is a deficient number, since it is larger than the sum of its proper divisors (289890199).
5333662121 is a wasteful number, since it uses less digits than its factorization.
5333662121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458575.
The product of its digits is 19440, while the sum is 32.
The square root of 5333662121 is about 73031.9253546009. The cubic root of 5333662121 is about 1747.1968315452.
The spelling of 5333662121 in words is "five billion, three hundred thirty-three million, six hundred sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •