Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …10010111110101101000101 |
3 | 20120020020222212012101110222 |
4 | 23120121310102332231011 |
5 | 23030102131000000234 |
6 | 254243102414554125 |
7 | 13354250644555364 |
oct | 1330316422765505 |
9 | 216206885171428 |
10 | 50055500000069 |
11 | 14a49466895643 |
12 | 5745111808945 |
13 | 21c12a0aa66c5 |
14 | c509b05917db |
15 | 5bc0d22c442e |
hex | 2d86744beb45 |
50055500000069 has 2 divisors, whose sum is σ = 50055500000070. Its totient is φ = 50055500000068.
The previous prime is 50055500000021. The next prime is 50055500000083. The reversal of 50055500000069 is 96000000555005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31754746468225 + 18300753531844 = 5635135^2 + 4277938^2 .
It is a cyclic number.
It is not a de Polignac number, because 50055500000069 - 212 = 50055499995973 is a prime.
It is a super-2 number, since 2×500555000000692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50055499999984 and 50055500000038.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50055500008069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027750000034 + 25027750000035.
It is an arithmetic number, because the mean of its divisors is an integer number (25027750000035).
Almost surely, 250055500000069 is an apocalyptic number.
It is an amenable number.
50055500000069 is a deficient number, since it is larger than the sum of its proper divisors (1).
50055500000069 is an equidigital number, since it uses as much as digits as its factorization.
50055500000069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 33750, while the sum is 35.
The spelling of 50055500000069 in words is "fifty trillion, fifty-five billion, five hundred million, sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •