Base | Representation |
---|---|
bin | 1001100110000110011010… |
… | …1000110101100011111100 |
3 | 1101100120210220110022201221 |
4 | 2121201212220311203330 |
5 | 2340323212341111111 |
6 | 34234402150443124 |
7 | 2136136561322056 |
oct | 231414650654374 |
9 | 41316726408657 |
10 | 10550161660156 |
11 | 33a83312401a8 |
12 | 12248379634a4 |
13 | 5b6b506982c1 |
14 | 2868b83248d6 |
15 | 134679700371 |
hex | 99866a358fc |
10550161660156 has 24 divisors (see below), whose sum is σ = 19482025514000. Its totient is φ = 4985226290304.
The previous prime is 10550161660153. The next prime is 10550161660163. The reversal of 10550161660156 is 65106616105501.
10550161660156 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105501616601562 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550161660153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169672971 + ... + 169735138.
Almost surely, 210550161660156 is an apocalyptic number.
It is an amenable number.
10550161660156 is a deficient number, since it is larger than the sum of its proper divisors (8931863853844).
10550161660156 is a wasteful number, since it uses less digits than its factorization.
10550161660156 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339408541 (or 339408539 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 43.
Adding to 10550161660156 its reverse (65106616105501), we get a palindrome (75656777765657).
It can be divided in two parts, 1055016 and 1660156, that added together give a palindrome (2715172).
The spelling of 10550161660156 in words is "ten trillion, five hundred fifty billion, one hundred sixty-one million, six hundred sixty thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •