Base | Representation |
---|---|
bin | 101110110000001011… |
… | …011101101010000011 |
3 | 11210120112222100012122 |
4 | 232300023131222003 |
5 | 1310302302412311 |
6 | 35021201314455 |
7 | 3425004442214 |
oct | 566013355203 |
9 | 153515870178 |
10 | 50200435331 |
11 | 1a320923092 |
12 | 9890035a2b |
13 | 497044a207 |
14 | 26031c740b |
15 | 148c2880db |
hex | bb02dda83 |
50200435331 has 2 divisors, whose sum is σ = 50200435332. Its totient is φ = 50200435330.
The previous prime is 50200435321. The next prime is 50200435333. The reversal of 50200435331 is 13353400205.
50200435331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50200435331 - 210 = 50200434307 is a prime.
It is a super-2 number, since 2×502004353312 (a number of 22 digits) contains 22 as substring.
Together with 50200435333, 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 50200435331.
It is not a weakly prime, because it can be changed into another prime (50200435333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25100217665 + 25100217666.
It is an arithmetic number, because the mean of its divisors is an integer number (25100217666).
Almost surely, 250200435331 is an apocalyptic number.
50200435331 is a deficient number, since it is larger than the sum of its proper divisors (1).
50200435331 is an equidigital number, since it uses as much as digits as its factorization.
50200435331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 26.
Adding to 50200435331 its reverse (13353400205), we get a palindrome (63553835536).
The spelling of 50200435331 in words is "fifty billion, two hundred million, four hundred thirty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •