Base | Representation |
---|---|
bin | 101100110101001001000… |
… | …0111001100000101001001 |
3 | 210211000201221221211202102 |
4 | 1121222102013030011021 |
5 | 1301422104210213424 |
6 | 21034305055443145 |
7 | 1204102042534010 |
oct | 131522207140511 |
9 | 23730657854672 |
10 | 6161434460489 |
11 | 1a66060140a50 |
12 | 836163b264b5 |
13 | 3590368524b9 |
14 | 174302025a77 |
15 | aa4168257ae |
hex | 59a921cc149 |
6161434460489 has 32 divisors (see below), whose sum is σ = 7759754415360. Its totient is φ = 4752412416000.
The previous prime is 6161434460473. The next prime is 6161434460491. The reversal of 6161434460489 is 9840644341616.
It is a cyclic number.
It is not a de Polignac number, because 6161434460489 - 24 = 6161434460473 is a prime.
It is a super-2 number, since 2×61614344604892 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) 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 not an unprimeable number, because it can be changed into a prime (6161434460449) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32202497 + ... + 32393265.
It is an arithmetic number, because the mean of its divisors is an integer number (242492325480).
Almost surely, 26161434460489 is an apocalyptic number.
It is an amenable number.
6161434460489 is a deficient number, since it is larger than the sum of its proper divisors (1598319954871).
6161434460489 is a wasteful number, since it uses less digits than its factorization.
6161434460489 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195041.
The product of its (nonzero) digits is 11943936, while the sum is 56.
The spelling of 6161434460489 in words is "six trillion, one hundred sixty-one billion, four hundred thirty-four million, four hundred sixty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •