Base | Representation |
---|---|
bin | 111110101011011111011101… |
… | …1100110100011010011011101 |
3 | 2200022010010120001001201201202 |
4 | 1331112332323212203103131 |
5 | 1034231034004332043401 |
6 | 5232331522332045245 |
7 | 224062440402216644 |
oct | 17526767346432335 |
9 | 2608103501051652 |
10 | 551335214331101 |
11 | 14a743a51235222 |
12 | 51a0455b903825 |
13 | 1a8838c29390b5 |
14 | 9a20aa3d8c35b |
15 | 43b1762c4e06b |
hex | 1f56fbb9a34dd |
551335214331101 has 2 divisors, whose sum is σ = 551335214331102. Its totient is φ = 551335214331100.
The previous prime is 551335214331079. The next prime is 551335214331149. The reversal of 551335214331101 is 101133412533155.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 450417639072025 + 100917575259076 = 21223045^2 + 10045774^2 .
It is a cyclic number.
It is not a de Polignac number, because 551335214331101 - 26 = 551335214331037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (551335214339101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275667607165550 + 275667607165551.
It is an arithmetic number, because the mean of its divisors is an integer number (275667607165551).
Almost surely, 2551335214331101 is an apocalyptic number.
It is an amenable number.
551335214331101 is a deficient number, since it is larger than the sum of its proper divisors (1).
551335214331101 is an equidigital number, since it uses as much as digits as its factorization.
551335214331101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 551335214331101 its reverse (101133412533155), we get a palindrome (652468626864256).
The spelling of 551335214331101 in words is "five hundred fifty-one trillion, three hundred thirty-five billion, two hundred fourteen million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •