Base | Representation |
---|---|
bin | 1001001011011110… |
… | …01010101001011001 |
3 | 110201110001211202102 |
4 | 10211233022221121 |
5 | 40043042314130 |
6 | 2133002013145 |
7 | 233060030303 |
oct | 44557125131 |
9 | 13643054672 |
10 | 4928088665 |
11 | 20a9860a55 |
12 | b564a71b5 |
13 | 606ca10c6 |
14 | 34a702973 |
15 | 1dc99e645 |
hex | 125bcaa59 |
4928088665 has 16 divisors (see below), whose sum is σ = 6028153488. Its totient is φ = 3866244096.
The previous prime is 4928088661. The next prime is 4928088701. The reversal of 4928088665 is 5668808294.
It can be written as a sum of positive squares in 8 ways, for example, as 405257161 + 4522831504 = 20131^2 + 67252^2 .
It is a cyclic number.
It is not a de Polignac number, because 4928088665 - 22 = 4928088661 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4928088665.
It is not an unprimeable number, because it can be changed into a prime (4928088661) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 907037 + ... + 912453.
It is an arithmetic number, because the mean of its divisors is an integer number (376759593).
Almost surely, 24928088665 is an apocalyptic number.
It is an amenable number.
4928088665 is a deficient number, since it is larger than the sum of its proper divisors (1100064823).
4928088665 is a wasteful number, since it uses less digits than its factorization.
4928088665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8908.
The product of its (nonzero) digits is 6635520, while the sum is 56.
The square root of 4928088665 is about 70200.3466159534. The cubic root of 4928088665 is about 1701.7385518657.
The spelling of 4928088665 in words is "four billion, nine hundred twenty-eight million, eighty-eight thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •