Base | Representation |
---|---|
bin | 1011010101101111… |
… | …11000001000001101 |
3 | 120201021122102222222 |
4 | 11222313320020031 |
5 | 44432012000023 |
6 | 2444034545125 |
7 | 303603101114 |
oct | 55267701015 |
9 | 16637572888 |
10 | 6088000013 |
11 | 2644576577 |
12 | 121aa381a5 |
13 | 76039a594 |
14 | 41a798c7b |
15 | 25971bcc8 |
hex | 16adf820d |
6088000013 has 2 divisors, whose sum is σ = 6088000014. Its totient is φ = 6088000012.
The previous prime is 6088000003. The next prime is 6088000021. The reversal of 6088000013 is 3100008806.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5012356804 + 1075643209 = 70798^2 + 32797^2 .
It is a cyclic number.
It is not a de Polignac number, because 6088000013 - 210 = 6087998989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6088000003) 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, 3044000006 + 3044000007.
It is an arithmetic number, because the mean of its divisors is an integer number (3044000007).
Almost surely, 26088000013 is an apocalyptic number.
It is an amenable number.
6088000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
6088000013 is an equidigital number, since it uses as much as digits as its factorization.
6088000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 6088000013 is about 78025.6368958306. The cubic root of 6088000013 is about 1825.9612138446.
Adding to 6088000013 its reverse (3100008806), we get a palindrome (9188008819).
The spelling of 6088000013 in words is "six billion, eighty-eight million, thirteen", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •