Base | Representation |
---|---|
bin | 101111000100101110… |
… | …110101001110000011 |
3 | 11211110120210210122212 |
4 | 233010232311032003 |
5 | 1312004041014303 |
6 | 35115320052335 |
7 | 3436362355256 |
oct | 570456651603 |
9 | 154416723585 |
10 | 50545251203 |
11 | 1a488527387 |
12 | 99676040ab |
13 | 49c6a09885 |
14 | 2636d0509d |
15 | 14ac69aad8 |
hex | bc4bb5383 |
50545251203 has 2 divisors, whose sum is σ = 50545251204. Its totient is φ = 50545251202.
The previous prime is 50545251199. The next prime is 50545251217. The reversal of 50545251203 is 30215254505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50545251203 - 22 = 50545251199 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50545251203.
It is not a weakly prime, because it can be changed into another prime (50545251103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25272625601 + 25272625602.
It is an arithmetic number, because the mean of its divisors is an integer number (25272625602).
Almost surely, 250545251203 is an apocalyptic number.
50545251203 is a deficient number, since it is larger than the sum of its proper divisors (1).
50545251203 is an equidigital number, since it uses as much as digits as its factorization.
50545251203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 32.
It can be divided in two parts, 505452 and 51203, that added together give a palindrome (556655).
The spelling of 50545251203 in words is "fifty billion, five hundred forty-five million, two hundred fifty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •