Base | Representation |
---|---|
bin | 1011010000010100… |
… | …01100101101111011 |
3 | 120121002222100100000 |
4 | 11220022030231323 |
5 | 44333333040131 |
6 | 2435331044043 |
7 | 302511105243 |
oct | 55012145573 |
9 | 16532870300 |
10 | 6042471291 |
11 | 26208aa12a |
12 | 1207740623 |
13 | 753b193cc |
14 | 414706b23 |
15 | 255726ce6 |
hex | 16828cb7b |
6042471291 has 24 divisors (see below), whose sum is σ = 9363397680. Its totient is φ = 3889402272.
The previous prime is 6042471269. The next prime is 6042471301. The reversal of 6042471291 is 1921742406.
It is a happy number.
6042471291 is a `hidden beast` number, since 60 + 42 + 471 + 2 + 91 = 666.
It is not a de Polignac number, because 6042471291 - 27 = 6042471163 is a prime.
It is a super-3 number, since 3×60424712913 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (6042471251) 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 in 23 ways as a sum of consecutive naturals, for example, 421680 + ... + 435773.
It is an arithmetic number, because the mean of its divisors is an integer number (390141570).
Almost surely, 26042471291 is an apocalyptic number.
6042471291 is a deficient number, since it is larger than the sum of its proper divisors (3320926389).
6042471291 is an equidigital number, since it uses as much as digits as its factorization.
6042471291 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857497 (or 857485 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 6042471291 is about 77733.3344904231. The cubic root of 6042471291 is about 1821.3980413588.
The spelling of 6042471291 in words is "six billion, forty-two million, four hundred seventy-one thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •