Base | Representation |
---|---|
bin | 1110111100101000001101… |
… | …1001011001000100010001 |
3 | 2011012010221221100212002122 |
4 | 3233022003121121010101 |
5 | 4123231331313033230 |
6 | 54542004123224025 |
7 | 3314241260335361 |
oct | 357120331310421 |
9 | 64163857325078 |
10 | 16434749346065 |
11 | 5266a35609896 |
12 | 1a151b8378015 |
13 | 922a3713908b |
14 | 40b6361c09a1 |
15 | 1d778b341be5 |
hex | ef283659111 |
16434749346065 has 4 divisors (see below), whose sum is σ = 19721699215284. Its totient is φ = 13147799476848.
The previous prime is 16434749346023. The next prime is 16434749346109. The reversal of 16434749346065 is 56064394743461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6089597579521 + 10345151766544 = 2467711^2 + 3216388^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16434749346065 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16434749345989 and 16434749346007.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1643474934602 + ... + 1643474934611.
It is an arithmetic number, because the mean of its divisors is an integer number (4930424803821).
Almost surely, 216434749346065 is an apocalyptic number.
It is an amenable number.
16434749346065 is a deficient number, since it is larger than the sum of its proper divisors (3286949869219).
16434749346065 is an equidigital number, since it uses as much as digits as its factorization.
16434749346065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3286949869218.
The product of its (nonzero) digits is 156764160, while the sum is 62.
The spelling of 16434749346065 in words is "sixteen trillion, four hundred thirty-four billion, seven hundred forty-nine million, three hundred forty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •