Base | Representation |
---|---|
bin | 1111001001110011… |
… | …00011011110010011 |
3 | 202222221221000210211 |
4 | 13210321203132103 |
5 | 113130111310201 |
6 | 3423130504551 |
7 | 405412366222 |
oct | 74471433623 |
9 | 22887830724 |
10 | 8135260051 |
11 | 34a5162316 |
12 | 16b0595157 |
13 | 9c8580b59 |
14 | 572636cb9 |
15 | 329317651 |
hex | 1e4e63793 |
8135260051 has 4 divisors (see below), whose sum is σ = 8187077152. Its totient is φ = 8083442952.
The previous prime is 8135260027. The next prime is 8135260079. The reversal of 8135260051 is 1500625318.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8135260051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8135259995 and 8135260022.
It is not an unprimeable number, because it can be changed into a prime (8135260451) 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 3 ways as a sum of consecutive naturals, for example, 25908315 + ... + 25908628.
It is an arithmetic number, because the mean of its divisors is an integer number (2046769288).
Almost surely, 28135260051 is an apocalyptic number.
8135260051 is a deficient number, since it is larger than the sum of its proper divisors (51817101).
8135260051 is a wasteful number, since it uses less digits than its factorization.
8135260051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51817100.
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 8135260051 is about 90195.6764540297. The cubic root of 8135260051 is about 2011.2087356873.
Adding to 8135260051 its reverse (1500625318), we get a palindrome (9635885369).
The spelling of 8135260051 in words is "eight billion, one hundred thirty-five million, two hundred sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •