Base | Representation |
---|---|
bin | 101110110000001110… |
… | …001010101010111101 |
3 | 11210120121022100022112 |
4 | 232300032022222331 |
5 | 1310302443101442 |
6 | 35021224423405 |
7 | 3425013453254 |
oct | 566016125275 |
9 | 153517270275 |
10 | 50201143997 |
11 | 1a321267564 |
12 | 9890317b65 |
13 | 4970637944 |
14 | 260332d79b |
15 | 148c378082 |
hex | bb038aabd |
50201143997 has 2 divisors, whose sum is σ = 50201143998. Its totient is φ = 50201143996.
The previous prime is 50201143961. The next prime is 50201144017. The reversal of 50201143997 is 79934110205.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44445494041 + 5755649956 = 210821^2 + 75866^2 .
It is a cyclic number.
It is not a de Polignac number, because 50201143997 - 210 = 50201142973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50201143397) 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, 25100571998 + 25100571999.
It is an arithmetic number, because the mean of its divisors is an integer number (25100571999).
Almost surely, 250201143997 is an apocalyptic number.
It is an amenable number.
50201143997 is a deficient number, since it is larger than the sum of its proper divisors (1).
50201143997 is an equidigital number, since it uses as much as digits as its factorization.
50201143997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 50201143997 in words is "fifty billion, two hundred one million, one hundred forty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •