Base | Representation |
---|---|
bin | 100100101111110100110… |
… | …0011110011011111000011 |
3 | 122212211020101021111110111 |
4 | 1021133221203303133003 |
5 | 1130221413243100201 |
6 | 14424100415012151 |
7 | 1030613136414046 |
oct | 111375143633703 |
9 | 18784211244414 |
10 | 5050505050051 |
11 | 16779a848614a |
12 | 6969a3b0a057 |
13 | 2a8350666876 |
14 | 1366351c4c5d |
15 | 8b5965cab51 |
hex | 497e98f37c3 |
5050505050051 has 2 divisors, whose sum is σ = 5050505050052. Its totient is φ = 5050505050050.
The previous prime is 5050505050043. The next prime is 5050505050057. The reversal of 5050505050051 is 1500505050505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5050505050051 - 23 = 5050505050043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5050505049995 and 5050505050022.
It is not a weakly prime, because it can be changed into another prime (5050505050057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525252525025 + 2525252525026.
It is an arithmetic number, because the mean of its divisors is an integer number (2525252525026).
Almost surely, 25050505050051 is an apocalyptic number.
5050505050051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050505050051 is an equidigital number, since it uses as much as digits as its factorization.
5050505050051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 5050505050051 in words is "five trillion, fifty billion, five hundred five million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •