Base | Representation |
---|---|
bin | 1001110101101001… |
… | …11001111100101001 |
3 | 111122002212001210002 |
4 | 10322310321330221 |
5 | 41304132232130 |
6 | 2232041432345 |
7 | 244614351056 |
oct | 47264717451 |
9 | 14562761702 |
10 | 5281914665 |
11 | 2270559735 |
12 | 1034a9b6b5 |
13 | 6623968c1 |
14 | 3816c802d |
15 | 20da91b45 |
hex | 13ad39f29 |
5281914665 has 8 divisors (see below), whose sum is σ = 6442204488. Its totient is φ = 4156260480.
The previous prime is 5281914647. The next prime is 5281914679. The reversal of 5281914665 is 5664191825.
5281914665 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 208629136 + 5073285529 = 14444^2 + 71227^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5281914665 - 26 = 5281914601 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 8658572 + ... + 8659181.
It is an arithmetic number, because the mean of its divisors is an integer number (805275561).
Almost surely, 25281914665 is an apocalyptic number.
It is an amenable number.
5281914665 is a deficient number, since it is larger than the sum of its proper divisors (1160289823).
5281914665 is a wasteful number, since it uses less digits than its factorization.
5281914665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17317819.
The product of its digits is 518400, while the sum is 47.
The square root of 5281914665 is about 72676.7821590912. The cubic root of 5281914665 is about 1741.5279951048.
The spelling of 5281914665 in words is "five billion, two hundred eighty-one million, nine hundred fourteen thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •