Base | Representation |
---|---|
bin | 1000101100100101… |
… | …00011101110000101 |
3 | 110001101102021012111 |
4 | 10112102203232011 |
5 | 34030221242244 |
6 | 2051143221021 |
7 | 223462154404 |
oct | 42622435605 |
9 | 13041367174 |
10 | 4668930949 |
11 | 1a86542a21 |
12 | aa3747771 |
13 | 5953a3347 |
14 | 32412163b |
15 | 1c4d5be34 |
hex | 1164a3b85 |
4668930949 has 8 divisors (see below), whose sum is σ = 4987324440. Its totient is φ = 4355398656.
The previous prime is 4668930947. The next prime is 4668930997. The reversal of 4668930949 is 9490398664.
It can be written as a sum of positive squares in 4 ways, for example, as 856732900 + 3812198049 = 29270^2 + 61743^2 .
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 4668930949 - 21 = 4668930947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4668930893 and 4668930902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4668930947) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1213314 + ... + 1217155.
It is an arithmetic number, because the mean of its divisors is an integer number (623415555).
Almost surely, 24668930949 is an apocalyptic number.
It is an amenable number.
4668930949 is a deficient number, since it is larger than the sum of its proper divisors (318393491).
4668930949 is a wasteful number, since it uses less digits than its factorization.
4668930949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2430599.
The product of its (nonzero) digits is 10077696, while the sum is 58.
The square root of 4668930949 is about 68329.5759462914. The cubic root of 4668930949 is about 1671.3695422860.
The spelling of 4668930949 in words is "four billion, six hundred sixty-eight million, nine hundred thirty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •