Base | Representation |
---|---|
bin | 100101100101101000110001… |
… | …011110111011001110111001 |
3 | 210200022212122100200100002022 |
4 | 211211220301132323032321 |
5 | 133132001310040213221 |
6 | 1343332131533444225 |
7 | 46551360016043441 |
oct | 4545506136731671 |
9 | 720285570610068 |
10 | 165314121413561 |
11 | 4874636389805a |
12 | 1665ab98940675 |
13 | 71320933c65b3 |
14 | 2cb73636b3121 |
15 | 141a2edd6a4ab |
hex | 965a317bb3b9 |
165314121413561 has 4 divisors (see below), whose sum is σ = 165315230658852. Its totient is φ = 165313012168272.
The previous prime is 165314121413537. The next prime is 165314121413653.
165314121413561 is nontrivially palindromic in base 10.
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 27841779393961 + 137472342019600 = 5276531^2 + 11724860^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165314121413561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165314121413461) 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, 554399066 + ... + 554697171.
It is an arithmetic number, because the mean of its divisors is an integer number (41328807664713).
Almost surely, 2165314121413561 is an apocalyptic number.
It is an amenable number.
165314121413561 is a deficient number, since it is larger than the sum of its proper divisors (1109245291).
165314121413561 is a wasteful number, since it uses less digits than its factorization.
165314121413561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109245290.
The product of its digits is 259200, while the sum is 44.
The spelling of 165314121413561 in words is "one hundred sixty-five trillion, three hundred fourteen billion, one hundred twenty-one million, four hundred thirteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •