Base | Representation |
---|---|
bin | 100101100100000111111111… |
… | …111001010011110100110100 |
3 | 210122221221102121111111201222 |
4 | 211210013333321103310310 |
5 | 133123301002311113012 |
6 | 1343212304533005512 |
7 | 46541021010544661 |
oct | 4544077771236464 |
9 | 718857377444658 |
10 | 165210210254132 |
11 | 48706290737a9a |
12 | 16642a19183898 |
13 | 71253434cc744 |
14 | 2cb2307026a68 |
15 | 141776b5a8972 |
hex | 9641ffe53d34 |
165210210254132 has 6 divisors (see below), whose sum is σ = 289117867944738. Its totient is φ = 82605105127064.
The previous prime is 165210210254071. The next prime is 165210210254189. The reversal of 165210210254132 is 231452012012561.
It can be written as a sum of positive squares in only one way, i.e., 159335180822416 + 5875029431716 = 12622804^2 + 2423846^2 .
It is a junction number, because it is equal to n+sod(n) for n = 165210210254092 and 165210210254101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20651276281763 + ... + 20651276281770.
It is an arithmetic number, because the mean of its divisors is an integer number (48186311324123).
Almost surely, 2165210210254132 is an apocalyptic number.
It is an amenable number.
165210210254132 is a deficient number, since it is larger than the sum of its proper divisors (123907657690606).
165210210254132 is a wasteful number, since it uses less digits than its factorization.
165210210254132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41302552563537 (or 41302552563535 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 165210210254132 its reverse (231452012012561), we get a palindrome (396662222266693).
The spelling of 165210210254132 in words is "one hundred sixty-five trillion, two hundred ten billion, two hundred ten million, two hundred fifty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •