Base | Representation |
---|---|
bin | 101110101101001111… |
… | …010100101110001101 |
3 | 11210110010011122100012 |
4 | 232231033110232031 |
5 | 1310202141200121 |
6 | 35012240243005 |
7 | 3423535310123 |
oct | 565517245615 |
9 | 153403148305 |
10 | 50151115661 |
11 | 1a2a5aa7529 |
12 | 9877610465 |
13 | 496316c68a |
14 | 25da829913 |
15 | 1487c94c5b |
hex | bad3d4b8d |
50151115661 has 2 divisors, whose sum is σ = 50151115662. Its totient is φ = 50151115660.
The previous prime is 50151115649. The next prime is 50151115669. The reversal of 50151115661 is 16651115105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33463384900 + 16687730761 = 182930^2 + 129181^2 .
It is a cyclic number.
It is not a de Polignac number, because 50151115661 - 230 = 49077373837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50151115669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25075557830 + 25075557831.
It is an arithmetic number, because the mean of its divisors is an integer number (25075557831).
Almost surely, 250151115661 is an apocalyptic number.
It is an amenable number.
50151115661 is a deficient number, since it is larger than the sum of its proper divisors (1).
50151115661 is an equidigital number, since it uses as much as digits as its factorization.
50151115661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 32.
The spelling of 50151115661 in words is "fifty billion, one hundred fifty-one million, one hundred fifteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •