Base | Representation |
---|---|
bin | 1011011110011111… |
… | …00010101010000101 |
3 | 120220101121002200011 |
4 | 11233033202222011 |
5 | 100104243444024 |
6 | 2455214150221 |
7 | 305453201611 |
oct | 55717425205 |
9 | 16811532604 |
10 | 6161312389 |
11 | 268199a211 |
12 | 123b4b2371 |
13 | 77262899b |
14 | 426400341 |
15 | 260d9e094 |
hex | 16f3e2a85 |
6161312389 has 4 divisors (see below), whose sum is σ = 6208345440. Its totient is φ = 6114279340.
The previous prime is 6161312387. The next prime is 6161312441. The reversal of 6161312389 is 9832131616.
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.
It is a cyclic number.
It is not a de Polignac number, because 6161312389 - 21 = 6161312387 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6161312387) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23516329 + ... + 23516590.
It is an arithmetic number, because the mean of its divisors is an integer number (1552086360).
Almost surely, 26161312389 is an apocalyptic number.
It is an amenable number.
6161312389 is a deficient number, since it is larger than the sum of its proper divisors (47033051).
6161312389 is a wasteful number, since it uses less digits than its factorization.
6161312389 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47033050.
The product of its digits is 46656, while the sum is 40.
The square root of 6161312389 is about 78494.0277282291. The cubic root of 6161312389 is about 1833.2614645950.
The spelling of 6161312389 in words is "six billion, one hundred sixty-one million, three hundred twelve thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •