Base | Representation |
---|---|
bin | 1111000111010010… |
… | …11010000101000111 |
3 | 202221111101121111211 |
4 | 13203221122011013 |
5 | 113104222000210 |
6 | 3421100312251 |
7 | 405035662462 |
oct | 74351320507 |
9 | 22844347454 |
10 | 8114250055 |
11 | 349431218a |
12 | 16a5542687 |
13 | 9c4105ac2 |
14 | 56d9282d9 |
15 | 32756738a |
hex | 1e3a5a147 |
8114250055 has 4 divisors (see below), whose sum is σ = 9737100072. Its totient is φ = 6491400040.
The previous prime is 8114250047. The next prime is 8114250071. The reversal of 8114250055 is 5500524118.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 8114250055 - 23 = 8114250047 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8114249999 and 8114250026.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 811425001 + ... + 811425010.
It is an arithmetic number, because the mean of its divisors is an integer number (2434275018).
Almost surely, 28114250055 is an apocalyptic number.
8114250055 is a deficient number, since it is larger than the sum of its proper divisors (1622850017).
8114250055 is a wasteful number, since it uses less digits than its factorization.
8114250055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622850016.
The product of its (nonzero) digits is 8000, while the sum is 31.
The square root of 8114250055 is about 90079.1321838749. The cubic root of 8114250055 is about 2009.4758709467.
The spelling of 8114250055 in words is "eight billion, one hundred fourteen million, two hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •