Base | Representation |
---|---|
bin | 1011011010111001… |
… | …10101000000101101 |
3 | 120211022000022111012 |
4 | 11231130311000231 |
5 | 100024044203010 |
6 | 2452221435005 |
7 | 304636455131 |
oct | 55534650055 |
9 | 16738008435 |
10 | 6131241005 |
11 | 2666a2012a |
12 | 123140ba65 |
13 | 76932a376 |
14 | 4224133c1 |
15 | 25d40e005 |
hex | 16d73502d |
6131241005 has 32 divisors (see below), whose sum is σ = 7807363200. Its totient is φ = 4609440000.
The previous prime is 6131240993. The next prime is 6131241007. The reversal of 6131241005 is 5001421316.
6131241005 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6131241005 - 28 = 6131240749 is a prime.
It is a super-2 number, since 2×61312410052 = 75184232522786820050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6131241007) 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 31 ways as a sum of consecutive naturals, for example, 9275375 + ... + 9276035.
It is an arithmetic number, because the mean of its divisors is an integer number (243980100).
Almost surely, 26131241005 is an apocalyptic number.
It is an amenable number.
6131241005 is a deficient number, since it is larger than the sum of its proper divisors (1676122195).
6131241005 is a wasteful number, since it uses less digits than its factorization.
6131241005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1325.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 6131241005 is about 78302.2413791585. The cubic root of 6131241005 is about 1830.2740793070.
The spelling of 6131241005 in words is "six billion, one hundred thirty-one million, two hundred forty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •