Base | Representation |
---|---|
bin | 1011011110011000… |
… | …01001000111000001 |
3 | 120220022220211100100 |
4 | 11233030021013001 |
5 | 100104031440223 |
6 | 2455143113013 |
7 | 305442500664 |
oct | 55714110701 |
9 | 16808824310 |
10 | 6160421313 |
11 | 2681440792 |
12 | 123b142769 |
13 | 7723a6217 |
14 | 42624b6db |
15 | 260c75043 |
hex | 16f3091c1 |
6160421313 has 24 divisors (see below), whose sum is σ = 9024561000. Its totient is φ = 4048982784.
The previous prime is 6160421297. The next prime is 6160421321. The reversal of 6160421313 is 3131240616.
6160421313 is a `hidden beast` number, since 6 + 1 + 604 + 21 + 31 + 3 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 93257649 + 6067163664 = 9657^2 + 77892^2 .
It is not a de Polignac number, because 6160421313 - 24 = 6160421297 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6160421383) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 268531 + ... + 290567.
It is an arithmetic number, because the mean of its divisors is an integer number (376023375).
Almost surely, 26160421313 is an apocalyptic number.
It is an amenable number.
6160421313 is a deficient number, since it is larger than the sum of its proper divisors (2864139687).
6160421313 is a wasteful number, since it uses less digits than its factorization.
6160421313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22481 (or 22478 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 6160421313 is about 78488.3514478422. The cubic root of 6160421313 is about 1833.1730822317.
Adding to 6160421313 its reverse (3131240616), we get a palindrome (9291661929).
The spelling of 6160421313 in words is "six billion, one hundred sixty million, four hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •