Base | Representation |
---|---|
bin | 1011001101110001… |
… | …10011000010001111 |
3 | 120112121211012220212 |
4 | 11212320303002033 |
5 | 44312402214211 |
6 | 2433245433035 |
7 | 302131531646 |
oct | 54670630217 |
9 | 16477735825 |
10 | 6021132431 |
11 | 260a854a06 |
12 | 120056b77b |
13 | 74c587772 |
14 | 41195035d |
15 | 25390e38b |
hex | 166e3308f |
6021132431 has 2 divisors, whose sum is σ = 6021132432. Its totient is φ = 6021132430.
The previous prime is 6021132421. The next prime is 6021132451. The reversal of 6021132431 is 1342311206.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6021132431 - 230 = 4947390607 is a prime.
It is a super-2 number, since 2×60211324312 = 72508071503279939522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 6021132397 and 6021132406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6021132401) 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, 3010566215 + 3010566216.
It is an arithmetic number, because the mean of its divisors is an integer number (3010566216).
Almost surely, 26021132431 is an apocalyptic number.
6021132431 is a deficient number, since it is larger than the sum of its proper divisors (1).
6021132431 is an equidigital number, since it uses as much as digits as its factorization.
6021132431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 6021132431 is about 77595.9562799506. The cubic root of 6021132431 is about 1819.2514362115.
Adding to 6021132431 its reverse (1342311206), we get a palindrome (7363443637).
The spelling of 6021132431 in words is "six billion, twenty-one million, one hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •