Base | Representation |
---|---|
bin | 1001110010101100001101… |
… | …1100101010010001000011 |
3 | 1102010021010121022220000011 |
4 | 2130223003130222101003 |
5 | 2402344211040122201 |
6 | 34522014031205351 |
7 | 2160565043332405 |
oct | 234530334522103 |
9 | 42107117286004 |
10 | 10766467114051 |
11 | 3481040006230 |
12 | 125a744076857 |
13 | 601372b2aa3c |
14 | 293157b6ab75 |
15 | 13a0d93a5151 |
hex | 9cac372a443 |
10766467114051 has 8 divisors (see below), whose sum is σ = 11752061530608. Its totient is φ = 9782010144000.
The previous prime is 10766467114033. The next prime is 10766467114057. The reversal of 10766467114051 is 15041176466701.
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 10766467114051 - 25 = 10766467114019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10766467113986 and 10766467114004.
It is not an unprimeable number, because it can be changed into a prime (10766467114057) 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, 284341830 + ... + 284379691.
It is an arithmetic number, because the mean of its divisors is an integer number (1469007691326).
Almost surely, 210766467114051 is an apocalyptic number.
10766467114051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10766467114051 is a deficient number, since it is larger than the sum of its proper divisors (985594416557).
10766467114051 is a wasteful number, since it uses less digits than its factorization.
10766467114051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 568723253.
The product of its (nonzero) digits is 846720, while the sum is 49.
The spelling of 10766467114051 in words is "ten trillion, seven hundred sixty-six billion, four hundred sixty-seven million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •