Base | Representation |
---|---|
bin | 101000000001010111101… |
… | …0110100000001000101101 |
3 | 201110211202022021000221202 |
4 | 1100002233112200020231 |
5 | 1210110011003103402 |
6 | 15410521141335245 |
7 | 1105253342665565 |
oct | 120025726401055 |
9 | 21424668230852 |
10 | 5500500050477 |
11 | 1830826976313 |
12 | 74a04a407525 |
13 | 30b9059b40a3 |
14 | 150323175da5 |
15 | 981321ccb02 |
hex | 500af5a022d |
5500500050477 has 2 divisors, whose sum is σ = 5500500050478. Its totient is φ = 5500500050476.
The previous prime is 5500500050473. The next prime is 5500500050491. The reversal of 5500500050477 is 7740500050055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5498996860036 + 1503190441 = 2344994^2 + 38771^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500500050477 - 22 = 5500500050473 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5500500050477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500500050471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750250025238 + 2750250025239.
It is an arithmetic number, because the mean of its divisors is an integer number (2750250025239).
Almost surely, 25500500050477 is an apocalyptic number.
It is an amenable number.
5500500050477 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500500050477 is an equidigital number, since it uses as much as digits as its factorization.
5500500050477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122500, while the sum is 38.
The spelling of 5500500050477 in words is "five trillion, five hundred billion, five hundred million, fifty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •