Base | Representation |
---|---|
bin | 101100000011101000010… |
… | …1100001011001011100011 |
3 | 210102212022001000210201212 |
4 | 1120013100230023023203 |
5 | 1243201331200123443 |
6 | 20513402413020335 |
7 | 1163316163103642 |
oct | 130072054131343 |
9 | 23385261023655 |
10 | 6055110161123 |
11 | 1a24a59914161 |
12 | 8196301846ab |
13 | 34bcc0a1bbaa |
14 | 16d0d7099359 |
15 | a7792294618 |
hex | 581d0b0b2e3 |
6055110161123 has 2 divisors, whose sum is σ = 6055110161124. Its totient is φ = 6055110161122.
The previous prime is 6055110161027. The next prime is 6055110161129. The reversal of 6055110161123 is 3211610115506.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6055110161123 is a prime.
It is a super-2 number, since 2×60551101611232 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6055110161123.
It is not a weakly prime, because it can be changed into another prime (6055110161129) 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 as a sum of consecutive naturals, namely, 3027555080561 + 3027555080562.
It is an arithmetic number, because the mean of its divisors is an integer number (3027555080562).
Almost surely, 26055110161123 is an apocalyptic number.
6055110161123 is a deficient number, since it is larger than the sum of its proper divisors (1).
6055110161123 is an equidigital number, since it uses as much as digits as its factorization.
6055110161123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 6055110161123 its reverse (3211610115506), we get a palindrome (9266720276629).
The spelling of 6055110161123 in words is "six trillion, fifty-five billion, one hundred ten million, one hundred sixty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •