Base | Representation |
---|---|
bin | 1001001111010111… |
… | …10101101010000111 |
3 | 110210201120021001222 |
4 | 10213223311222013 |
5 | 40124424130240 |
6 | 2140130310555 |
7 | 233634566216 |
oct | 44753655207 |
9 | 13721507058 |
10 | 4960770695 |
11 | 21162534a1 |
12 | b6542845b |
13 | 6109a4a9a |
14 | 350bad07d |
15 | 1e07a7eb5 |
hex | 127af5a87 |
4960770695 has 8 divisors (see below), whose sum is σ = 5953391136. Its totient is φ = 3968305696.
The previous prime is 4960770677. The next prime is 4960770707. The reversal of 4960770695 is 5960770694.
4960770695 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4960770695 - 228 = 4692335239 is a prime.
It is a Duffinian number.
It is a congruent 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, 49709 + ... + 111321.
It is an arithmetic number, because the mean of its divisors is an integer number (744173892).
Almost surely, 24960770695 is an apocalyptic number.
4960770695 is a deficient number, since it is larger than the sum of its proper divisors (992620441).
4960770695 is a wasteful number, since it uses less digits than its factorization.
4960770695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77721.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The square root of 4960770695 is about 70432.7388009298. The cubic root of 4960770695 is about 1705.4921217981.
Subtracting 4960770695 from its reverse (5960770694), we obtain a palindrome (999999999).
The spelling of 4960770695 in words is "four billion, nine hundred sixty million, seven hundred seventy thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •