Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …11100111001101000111111 |
3 | 20120012201221001001222111202 |
4 | 23120110233130321220333 |
5 | 23030010000300134232 |
6 | 254240401530410115 |
7 | 13353665616433523 |
oct | 1330245734715077 |
9 | 216181831058452 |
10 | 50050050005567 |
11 | 14a4711a476057 |
12 | 574405059093b |
13 | 21c09129507a1 |
14 | c50614833d83 |
15 | 5bbdb3ad1162 |
hex | 2d852f739a3f |
50050050005567 has 2 divisors, whose sum is σ = 50050050005568. Its totient is φ = 50050050005566.
The previous prime is 50050050005471. The next prime is 50050050005569. The reversal of 50050050005567 is 76550005005005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50050050005567 - 210 = 50050050004543 is a prime.
Together with 50050050005569, 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 50050050005567.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50050050005569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25025025002783 + 25025025002784.
It is an arithmetic number, because the mean of its divisors is an integer number (25025025002784).
Almost surely, 250050050005567 is an apocalyptic number.
50050050005567 is a deficient number, since it is larger than the sum of its proper divisors (1).
50050050005567 is an equidigital number, since it uses as much as digits as its factorization.
50050050005567 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 50050050005567 in words is "fifty trillion, fifty billion, fifty million, five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •