Base | Representation |
---|---|
bin | 101000011000111001010… |
… | …1001000011111100111111 |
3 | 201122200011012112221012011 |
4 | 1100301302221003330333 |
5 | 1211421442401110101 |
6 | 15450034235152051 |
7 | 1112022322641523 |
oct | 120616251037477 |
9 | 21580135487164 |
10 | 5551021113151 |
11 | 18501a1781478 |
12 | 7579a98a5627 |
13 | 3135c76a1c07 |
14 | 152956b81d83 |
15 | 995dc69b751 |
hex | 50c72a43f3f |
5551021113151 has 2 divisors, whose sum is σ = 5551021113152. Its totient is φ = 5551021113150.
The previous prime is 5551021113109. The next prime is 5551021113179. The reversal of 5551021113151 is 1513111201555.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5551021113151 - 27 = 5551021113023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5551021113191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2775510556575 + 2775510556576.
It is an arithmetic number, because the mean of its divisors is an integer number (2775510556576).
Almost surely, 25551021113151 is an apocalyptic number.
5551021113151 is a deficient number, since it is larger than the sum of its proper divisors (1).
5551021113151 is an equidigital number, since it uses as much as digits as its factorization.
5551021113151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 5551021113151 in words is "five trillion, five hundred fifty-one billion, twenty-one million, one hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •