Base | Representation |
---|---|
bin | 10110110011100111011110… |
… | …01111101100000100110011 |
3 | 20120120111012201211221222012 |
4 | 23121303233033230010303 |
5 | 23033142400303443121 |
6 | 254355311251433135 |
7 | 13364236413264443 |
oct | 1331635717540463 |
9 | 216514181757865 |
10 | 50152052015411 |
11 | 14a864029a0845 |
12 | 575b9788b57ab |
13 | 21ca41a15c328 |
14 | c5552d714123 |
15 | 5be883978c5b |
hex | 2d9cef3ec133 |
50152052015411 has 2 divisors, whose sum is σ = 50152052015412. Its totient is φ = 50152052015410.
The previous prime is 50152052015369. The next prime is 50152052015459. The reversal of 50152052015411 is 11451025025105.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50152052015411 - 226 = 50151984906547 is a prime.
It is not a weakly prime, because it can be changed into another prime (50152052065411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25076026007705 + 25076026007706.
It is an arithmetic number, because the mean of its divisors is an integer number (25076026007706).
Almost surely, 250152052015411 is an apocalyptic number.
50152052015411 is a deficient number, since it is larger than the sum of its proper divisors (1).
50152052015411 is an equidigital number, since it uses as much as digits as its factorization.
50152052015411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10000, while the sum is 32.
The spelling of 50152052015411 in words is "fifty trillion, one hundred fifty-two billion, fifty-two million, fifteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •