Base | Representation |
---|---|
bin | 1001010101011111100100… |
… | …0111100101111001010111 |
3 | 1100100022101111020202212002 |
4 | 2111113321013211321113 |
5 | 2321134411213342114 |
6 | 33455335424345515 |
7 | 2106416465445203 |
oct | 225277107457127 |
9 | 40308344222762 |
10 | 10264856387159 |
11 | 32a833490a890 |
12 | 119949377529b |
13 | 595c8308c83a |
14 | 276b70a5db03 |
15 | 12c02c1547de |
hex | 955f91e5e57 |
10264856387159 has 8 divisors (see below), whose sum is σ = 11198074023552. Its totient is φ = 9331646896440.
The previous prime is 10264856387143. The next prime is 10264856387167. The reversal of 10264856387159 is 95178365846201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10264856387159 - 24 = 10264856387143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10264856387095 and 10264856387104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10264856387119) 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, 766172 + ... + 4595294.
It is an arithmetic number, because the mean of its divisors is an integer number (1399759252944).
It is a 1-persistent number, because it is pandigital, but 2⋅10264856387159 = 20529712774318 is not.
Almost surely, 210264856387159 is an apocalyptic number.
10264856387159 is a deficient number, since it is larger than the sum of its proper divisors (933217636393).
10264856387159 is a wasteful number, since it uses less digits than its factorization.
10264856387159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4072837.
The product of its (nonzero) digits is 87091200, while the sum is 65.
The spelling of 10264856387159 in words is "ten trillion, two hundred sixty-four billion, eight hundred fifty-six million, three hundred eighty-seven thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •