Base | Representation |
---|---|
bin | 1001110111111010011000… |
… | …1100000000000100010011 |
3 | 1102102211200012010002202011 |
4 | 2131332212030000010103 |
5 | 2410331414123131401 |
6 | 35031131134403351 |
7 | 2200222011605635 |
oct | 235764614000423 |
9 | 42384605102664 |
10 | 10856170520851 |
11 | 350609226a477 |
12 | 1273bb9660557 |
13 | 60996a375a86 |
14 | 297627500a55 |
15 | 13c5d9697451 |
hex | 9dfa6300113 |
10856170520851 has 8 divisors (see below), whose sum is σ = 10890537617520. Its totient is φ = 10821804182688.
The previous prime is 10856170520843. The next prime is 10856170520857. The reversal of 10856170520851 is 15802507165801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10856170520851 - 23 = 10856170520843 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10856170520795 and 10856170520804.
It is not an unprimeable number, because it can be changed into a prime (10856170520857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47063740 + ... + 47293846.
It is an arithmetic number, because the mean of its divisors is an integer number (1361317202190).
Almost surely, 210856170520851 is an apocalyptic number.
10856170520851 is a deficient number, since it is larger than the sum of its proper divisors (34367096669).
10856170520851 is a wasteful number, since it uses less digits than its factorization.
10856170520851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379253.
The product of its (nonzero) digits is 672000, while the sum is 49.
The spelling of 10856170520851 in words is "ten trillion, eight hundred fifty-six billion, one hundred seventy million, five hundred twenty thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •