Base | Representation |
---|---|
bin | 1001001011001101… |
… | …11001001010101101 |
3 | 110201021222122210102 |
4 | 10211212321022231 |
5 | 40042013414132 |
6 | 2132443320445 |
7 | 233032425362 |
oct | 44546711255 |
9 | 13637878712 |
10 | 4925919917 |
11 | 20a860a5a6 |
12 | b55820125 |
13 | 6066c1c19 |
14 | 34a2da469 |
15 | 1dc6c1c62 |
hex | 1259b92ad |
4925919917 has 16 divisors (see below), whose sum is σ = 5237760000. Its totient is φ = 4619507760.
The previous prime is 4925919883. The next prime is 4925919919. The reversal of 4925919917 is 7199195294.
It is a cyclic number.
It is not a de Polignac number, because 4925919917 - 226 = 4858811053 is a prime.
It is a Smith number, since the sum of its digits (56) 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (4925919919) 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, 1202042 + ... + 1206132.
It is an arithmetic number, because the mean of its divisors is an integer number (327360000).
Almost surely, 24925919917 is an apocalyptic number.
It is an amenable number.
4925919917 is a deficient number, since it is larger than the sum of its proper divisors (311840083).
4925919917 is a wasteful number, since it uses less digits than its factorization.
4925919917 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4736.
The product of its digits is 1837080, while the sum is 56.
The square root of 4925919917 is about 70184.8980693140. The cubic root of 4925919917 is about 1701.4888821421.
The spelling of 4925919917 in words is "four billion, nine hundred twenty-five million, nine hundred nineteen thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •