Base | Representation |
---|---|
bin | 1001011010101010… |
… | …01110001010011011 |
3 | 111001022211021011211 |
4 | 10231111032022123 |
5 | 40323202130201 |
6 | 2153353003551 |
7 | 236165040532 |
oct | 45525161233 |
9 | 14038737154 |
10 | 5055505051 |
11 | 2164778853 |
12 | b910b35b7 |
13 | 6274c390c |
14 | 35d5cd319 |
15 | 1e8c6c651 |
hex | 12d54e29b |
5055505051 has 2 divisors, whose sum is σ = 5055505052. Its totient is φ = 5055505050.
The previous prime is 5055504977. The next prime is 5055505057. The reversal of 5055505051 is 1505055505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5055505051 - 217 = 5055373979 is a prime.
It is not a weakly prime, because it can be changed into another prime (5055505057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527752525 + 2527752526.
It is an arithmetic number, because the mean of its divisors is an integer number (2527752526).
Almost surely, 25055505051 is an apocalyptic number.
5055505051 is a deficient number, since it is larger than the sum of its proper divisors (1).
5055505051 is an equidigital number, since it uses as much as digits as its factorization.
5055505051 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 square root of 5055505051 is about 71102.0748712722. The cubic root of 5055505051 is about 1716.2801629918.
The spelling of 5055505051 in words is "five billion, fifty-five million, five hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •