Base | Representation |
---|---|
bin | 1011001011110000… |
… | …10100101110101001 |
3 | 120111110000112121221 |
4 | 11211320110232221 |
5 | 44244040343311 |
6 | 2431443302041 |
7 | 301535056612 |
oct | 54570245651 |
9 | 16443015557 |
10 | 6004231081 |
11 | 2601260752 |
12 | 11b697a921 |
13 | 748c1a874 |
14 | 40d5d0c09 |
15 | 2521c1671 |
hex | 165e14ba9 |
6004231081 has 2 divisors, whose sum is σ = 6004231082. Its totient is φ = 6004231080.
The previous prime is 6004231031. The next prime is 6004231091. The reversal of 6004231081 is 1801324006.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5865109056 + 139122025 = 76584^2 + 11795^2 .
It is a cyclic number.
It is not a de Polignac number, because 6004231081 - 215 = 6004198313 is a prime.
It is a super-2 number, since 2×60042310812 = 72101581748092857122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6004231031) 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, 3002115540 + 3002115541.
It is an arithmetic number, because the mean of its divisors is an integer number (3002115541).
Almost surely, 26004231081 is an apocalyptic number.
It is an amenable number.
6004231081 is a deficient number, since it is larger than the sum of its proper divisors (1).
6004231081 is an equidigital number, since it uses as much as digits as its factorization.
6004231081 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 25.
The square root of 6004231081 is about 77486.9736213772. The cubic root of 6004231081 is about 1817.5476249372.
Adding to 6004231081 its reverse (1801324006), we get a palindrome (7805555087).
The spelling of 6004231081 in words is "six billion, four million, two hundred thirty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •