Base | Representation |
---|---|
bin | 100110001110010001100… |
… | …0111101011110101010101 |
3 | 200121012202220010220200102 |
4 | 1030130203013223311111 |
5 | 1142032312030020432 |
6 | 15101203132023445 |
7 | 1051353343050224 |
oct | 114344307536525 |
9 | 20535686126612 |
10 | 5253334220117 |
11 | 1745a21238725 |
12 | 70a16b001b85 |
13 | 2c1505b57269 |
14 | 142396d20cbb |
15 | 919b80ec962 |
hex | 4c7231ebd55 |
5253334220117 has 4 divisors (see below), whose sum is σ = 5529825494880. Its totient is φ = 4976842945356.
The previous prime is 5253334220087. The next prime is 5253334220129. The reversal of 5253334220117 is 7110224333525.
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 5253334220117 - 210 = 5253334219093 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 (5253334220917) 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 3 ways as a sum of consecutive naturals, for example, 138245637353 + ... + 138245637390.
It is an arithmetic number, because the mean of its divisors is an integer number (1382456373720).
Almost surely, 25253334220117 is an apocalyptic number.
It is an amenable number.
5253334220117 is a deficient number, since it is larger than the sum of its proper divisors (276491274763).
5253334220117 is a wasteful number, since it uses less digits than its factorization.
5253334220117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276491274762.
The product of its (nonzero) digits is 151200, while the sum is 38.
The spelling of 5253334220117 in words is "five trillion, two hundred fifty-three billion, three hundred thirty-four million, two hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •