Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …11001000110101101101001 |
3 | 20121210202100012211012110221 |
4 | 23132313302321012231221 |
5 | 23104343002410230144 |
6 | 255223214323410041 |
7 | 13431335133465121 |
oct | 1336676271065551 |
9 | 217722305735427 |
10 | 50500005555049 |
11 | 150aaa28670136 |
12 | 57b72a5823921 |
13 | 222418ca6735b |
14 | c682db475c81 |
15 | 5c894aeddd84 |
hex | 2dedf2e46b69 |
50500005555049 has 2 divisors, whose sum is σ = 50500005555050. Its totient is φ = 50500005555048.
The previous prime is 50500005554989. The next prime is 50500005555119. The reversal of 50500005555049 is 94055550000505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50105615275024 + 394390280025 = 7078532^2 + 628005^2 .
It is a cyclic number.
It is not a de Polignac number, because 50500005555049 - 223 = 50499997166441 is a prime.
It is a super-2 number, since 2×505000055550492 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50500005554996 and 50500005555014.
It is not a weakly prime, because it can be changed into another prime (50500005555149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25250002777524 + 25250002777525.
It is an arithmetic number, because the mean of its divisors is an integer number (25250002777525).
Almost surely, 250500005555049 is an apocalyptic number.
It is an amenable number.
50500005555049 is a deficient number, since it is larger than the sum of its proper divisors (1).
50500005555049 is an equidigital number, since it uses as much as digits as its factorization.
50500005555049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 562500, while the sum is 43.
The spelling of 50500005555049 in words is "fifty trillion, five hundred billion, five million, five hundred fifty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •