Base | Representation |
---|---|
bin | 1001100111000100100… |
… | …1101111001101111001 |
3 | 120210011121012111122011 |
4 | 2121301021233031321 |
5 | 10201114411312403 |
6 | 203503230525521 |
7 | 14633336331436 |
oct | 2316111571571 |
9 | 523147174564 |
10 | 165107135353 |
11 | 64026745586 |
12 | 27bba0668a1 |
13 | 127533699c4 |
14 | 7dc3d02b8d |
15 | 4465007a6d |
hex | 267126f379 |
165107135353 has 4 divisors (see below), whose sum is σ = 165284861940. Its totient is φ = 164929408768.
The previous prime is 165107135329. The next prime is 165107135363. The reversal of 165107135353 is 353531701561.
It is a happy number.
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 3609245929 + 161497889424 = 60077^2 + 401868^2 .
It is a cyclic number.
It is not a de Polignac number, because 165107135353 - 217 = 165107004281 is a prime.
It is a super-2 number, since 2×1651071353532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165107135363) 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, 88861900 + ... + 88863757.
It is an arithmetic number, because the mean of its divisors is an integer number (41321215485).
Almost surely, 2165107135353 is an apocalyptic number.
It is an amenable number.
165107135353 is a deficient number, since it is larger than the sum of its proper divisors (177726587).
165107135353 is an equidigital number, since it uses as much as digits as its factorization.
165107135353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177726586.
The product of its (nonzero) digits is 141750, while the sum is 40.
The spelling of 165107135353 in words is "one hundred sixty-five billion, one hundred seven million, one hundred thirty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •