Base | Representation |
---|---|
bin | 101000000001010111101… |
… | …0110100000001010000111 |
3 | 201110211202022021001002002 |
4 | 1100002233112200022013 |
5 | 1210110011003104232 |
6 | 15410521141335515 |
7 | 1105253342666054 |
oct | 120025726401207 |
9 | 21424668231062 |
10 | 5500500050567 |
11 | 1830826976395 |
12 | 74a04a40759b |
13 | 30b9059b4142 |
14 | 15032317602b |
15 | 981321ccb62 |
hex | 500af5a0287 |
5500500050567 has 2 divisors, whose sum is σ = 5500500050568. Its totient is φ = 5500500050566.
The previous prime is 5500500050537. The next prime is 5500500050569. The reversal of 5500500050567 is 7650500050055.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5500500050567 - 242 = 1102453539463 is a prime.
Together with 5500500050569, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5500500050567.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500500050569) 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, 2750250025283 + 2750250025284.
It is an arithmetic number, because the mean of its divisors is an integer number (2750250025284).
Almost surely, 25500500050567 is an apocalyptic number.
5500500050567 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500500050567 is an equidigital number, since it uses as much as digits as its factorization.
5500500050567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131250, while the sum is 38.
The spelling of 5500500050567 in words is "five trillion, five hundred billion, five hundred million, fifty thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •