Base | Representation |
---|---|
bin | 100101000110111000001… |
… | …0010101000000001110101 |
3 | 200001120000110210011110211 |
4 | 1022031300102220001311 |
5 | 1132024310042023333 |
6 | 14502525020145421 |
7 | 1034315001452062 |
oct | 112156022500165 |
9 | 20046013704424 |
10 | 5100010111093 |
11 | 16969a1829237 |
12 | 6a44bb098271 |
13 | 2acc0ca03cb1 |
14 | 138badcb9c69 |
15 | 8c9e27a6ecd |
hex | 4a3704a8075 |
5100010111093 has 2 divisors, whose sum is σ = 5100010111094. Its totient is φ = 5100010111092.
The previous prime is 5100010111051. The next prime is 5100010111109. The reversal of 5100010111093 is 3901110100015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2555784137124 + 2544225973969 = 1598682^2 + 1595063^2 .
It is a cyclic number.
It is not a de Polignac number, because 5100010111093 - 229 = 5099473240181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5100010111013) 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, 2550005055546 + 2550005055547.
It is an arithmetic number, because the mean of its divisors is an integer number (2550005055547).
Almost surely, 25100010111093 is an apocalyptic number.
It is an amenable number.
5100010111093 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100010111093 is an equidigital number, since it uses as much as digits as its factorization.
5100010111093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 22.
The spelling of 5100010111093 in words is "five trillion, one hundred billion, ten million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •