Base | Representation |
---|---|
bin | 100101100100001100011111… |
… | …001100111011111011100110 |
3 | 210122222101212112120100022012 |
4 | 211210030133030323323212 |
5 | 133123340340244211014 |
6 | 1343214423122434222 |
7 | 46541251320612464 |
oct | 4544143714737346 |
9 | 718871775510265 |
10 | 165215030460134 |
11 | 48708334603116 |
12 | 16643943502972 |
13 | 712593102a145 |
14 | 2cb2643285834 |
15 | 141794e847c3e |
hex | 96431f33bee6 |
165215030460134 has 4 divisors (see below), whose sum is σ = 247822545690204. Its totient is φ = 82607515230066.
The previous prime is 165215030460131. The next prime is 165215030460167. The reversal of 165215030460134 is 431064030512561.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 165215030460091 and 165215030460100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165215030460131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41303757615032 + ... + 41303757615035.
It is an arithmetic number, because the mean of its divisors is an integer number (61955636422551).
Almost surely, 2165215030460134 is an apocalyptic number.
165215030460134 is a deficient number, since it is larger than the sum of its proper divisors (82607515230070).
165215030460134 is an equidigital number, since it uses as much as digits as its factorization.
165215030460134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82607515230069.
The product of its (nonzero) digits is 259200, while the sum is 41.
Adding to 165215030460134 its reverse (431064030512561), we get a palindrome (596279060972695).
The spelling of 165215030460134 in words is "one hundred sixty-five trillion, two hundred fifteen billion, thirty million, four hundred sixty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •