Base | Representation |
---|---|
bin | 1011010000000101… |
… | …10111111110010001 |
3 | 120120222100210121201 |
4 | 11220002313332101 |
5 | 44332340120223 |
6 | 2435221551201 |
7 | 302455560526 |
oct | 55002677621 |
9 | 16528323551 |
10 | 6040551313 |
11 | 261a808675 |
12 | 1206b75501 |
13 | 7535c6524 |
14 | 41436714d |
15 | 255497ead |
hex | 1680b7f91 |
6040551313 has 4 divisors (see below), whose sum is σ = 6040710720. Its totient is φ = 6040391908.
The previous prime is 6040551241. The next prime is 6040551331. The reversal of 6040551313 is 3131550406.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 6040551313 - 221 = 6038454161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6040551353) 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 3 ways as a sum of consecutive naturals, for example, 13356 + ... + 110722.
It is an arithmetic number, because the mean of its divisors is an integer number (1510177680).
Almost surely, 26040551313 is an apocalyptic number.
It is an amenable number.
6040551313 is a deficient number, since it is larger than the sum of its proper divisors (159407).
6040551313 is an equidigital number, since it uses as much as digits as its factorization.
6040551313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159406.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 6040551313 is about 77720.9837366975. The cubic root of 6040551313 is about 1821.2051062468.
The spelling of 6040551313 in words is "six billion, forty million, five hundred fifty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •