Base | Representation |
---|---|
bin | 100100100111111011010… |
… | …0110101110101000010101 |
3 | 122211012110100011111002122 |
4 | 1021033312212232220111 |
5 | 1124432144234114341 |
6 | 14412213405545325 |
7 | 1026442625330630 |
oct | 111176646565025 |
9 | 18735410144078 |
10 | 5033544051221 |
11 | 1670794435744 |
12 | 69364b875245 |
13 | 2a687977a49a |
14 | 1358a6778c17 |
15 | 8ae0255994b |
hex | 493f69aea15 |
5033544051221 has 8 divisors (see below), whose sum is σ = 5796534917184. Its totient is φ = 4281531471360.
The previous prime is 5033544051203. The next prime is 5033544051241. The reversal of 5033544051221 is 1221504453305.
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-5033544051221 is a prime.
It is a super-3 number, since 3×50335440512213 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5033544051241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2744570540 + ... + 2744572373.
It is an arithmetic number, because the mean of its divisors is an integer number (724566864648).
Almost surely, 25033544051221 is an apocalyptic number.
It is an amenable number.
5033544051221 is a deficient number, since it is larger than the sum of its proper divisors (762990865963).
5033544051221 is a wasteful number, since it uses less digits than its factorization.
5033544051221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5489143051.
The product of its (nonzero) digits is 72000, while the sum is 35.
The spelling of 5033544051221 in words is "five trillion, thirty-three billion, five hundred forty-four million, fifty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •