Base | Representation |
---|---|
bin | 11001000100100010011100… |
… | …01100100000010001011111 |
3 | 21020012112001212111220012021 |
4 | 30202101032030200101133 |
5 | 24211233314100042343 |
6 | 313131022250521011 |
7 | 14420056156613131 |
oct | 1442211614402137 |
9 | 236175055456167 |
10 | 55131512112223 |
11 | 16626163347aa8 |
12 | 6224a33a36167 |
13 | 249bb57a32111 |
14 | d885451d3051 |
15 | 65916cd330ed |
hex | 32244e32045f |
55131512112223 has 4 divisors (see below), whose sum is σ = 55131553368648. Its totient is φ = 55131470855800.
The previous prime is 55131512112221. The next prime is 55131512112241. The reversal of 55131512112223 is 32221121513155.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 55131512112223 - 21 = 55131512112221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55131512112221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18554236 + ... + 21319537.
It is an arithmetic number, because the mean of its divisors is an integer number (13782888342162).
Almost surely, 255131512112223 is an apocalyptic number.
55131512112223 is a deficient number, since it is larger than the sum of its proper divisors (41256425).
55131512112223 is a wasteful number, since it uses less digits than its factorization.
55131512112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41256424.
The product of its digits is 18000, while the sum is 34.
Adding to 55131512112223 its reverse (32221121513155), we get a palindrome (87352633625378).
The spelling of 55131512112223 in words is "fifty-five trillion, one hundred thirty-one billion, five hundred twelve million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •