Base | Representation |
---|---|
bin | 101000000100110000011… |
… | …0100110001011011101001 |
3 | 201111112112010200202220002 |
4 | 1100021200310301123221 |
5 | 1210214404231121134 |
6 | 15414122531512345 |
7 | 1105631510653253 |
oct | 120114064613351 |
9 | 21445463622802 |
10 | 5507772520169 |
11 | 1833919000447 |
12 | 74b539a586b5 |
13 | 30c4c4598caa |
14 | 150812d7acd3 |
15 | 9840a8b887e |
hex | 50260d316e9 |
5507772520169 has 2 divisors, whose sum is σ = 5507772520170. Its totient is φ = 5507772520168.
The previous prime is 5507772520163. The next prime is 5507772520193. The reversal of 5507772520169 is 9610252777055.
5507772520169 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3800472270400 + 1707300249769 = 1949480^2 + 1306637^2 .
It is a cyclic number.
It is not a de Polignac number, because 5507772520169 - 212 = 5507772516073 is a prime.
It is a super-2 number, since 2×55077725201692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5507772520163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2753886260084 + 2753886260085.
It is an arithmetic number, because the mean of its divisors is an integer number (2753886260085).
Almost surely, 25507772520169 is an apocalyptic number.
It is an amenable number.
5507772520169 is a deficient number, since it is larger than the sum of its proper divisors (1).
5507772520169 is an equidigital number, since it uses as much as digits as its factorization.
5507772520169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9261000, while the sum is 56.
The spelling of 5507772520169 in words is "five trillion, five hundred seven billion, seven hundred seventy-two million, five hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •