Base | Representation |
---|---|
bin | 1100000110010001000010000… |
… | …0101101010001010101100111 |
3 | 11010122020212210122120121200210 |
4 | 3001210100200231101111213 |
5 | 1343040414303220210114 |
6 | 12214332310421110503 |
7 | 344213310363415440 |
oct | 30144204055212547 |
9 | 4118225718517623 |
10 | 851314606413159 |
11 | 2272895516599a9 |
12 | 7b592583258433 |
13 | 2a703813727715 |
14 | 11031bbd8942c7 |
15 | 68649a72ad259 |
hex | 3064420b51567 |
851314606413159 has 16 divisors (see below), whose sum is σ = 1297244528037632. Its totient is φ = 486464280743808.
The previous prime is 851314606413143. The next prime is 851314606413199. The reversal of 851314606413159 is 951314606413158.
It is not a de Polignac number, because 851314606413159 - 24 = 851314606413143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 851314606413099 and 851314606413108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (851314606413199) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41671369 + ... + 58644114.
It is an arithmetic number, because the mean of its divisors is an integer number (81077783002352).
Almost surely, 2851314606413159 is an apocalyptic number.
851314606413159 is a deficient number, since it is larger than the sum of its proper divisors (445929921624473).
851314606413159 is a wasteful number, since it uses less digits than its factorization.
851314606413159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100719606.
The product of its (nonzero) digits is 9331200, while the sum is 57.
Subtracting 851314606413159 from its reverse (951314606413158), we obtain a palindrome (99999999999999).
The spelling of 851314606413159 in words is "eight hundred fifty-one trillion, three hundred fourteen billion, six hundred six million, four hundred thirteen thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •