Base | Representation |
---|---|
bin | 1001001111011101… |
… | …00111011101111111 |
3 | 110210202221021010111 |
4 | 10213232213131333 |
5 | 40130120432012 |
6 | 2140154050451 |
7 | 233644021453 |
oct | 44756473577 |
9 | 13722837114 |
10 | 4961499007 |
11 | 2116700703 |
12 | b65719a27 |
13 | 610b9b43a |
14 | 350d1c663 |
15 | 1e089dba7 |
hex | 127ba777f |
4961499007 has 4 divisors (see below), whose sum is σ = 4961657736. Its totient is φ = 4961340280.
The previous prime is 4961498987. The next prime is 4961499029. The reversal of 4961499007 is 7009941694.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4961499007 - 27 = 4961498879 is a prime.
It is a Smith number, since the sum of its digits (49) 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 (4961499097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15169 + ... + 100762.
It is an arithmetic number, because the mean of its divisors is an integer number (1240414434).
Almost surely, 24961499007 is an apocalyptic number.
4961499007 is a deficient number, since it is larger than the sum of its proper divisors (158729).
4961499007 is a wasteful number, since it uses less digits than its factorization.
4961499007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158728.
The product of its (nonzero) digits is 489888, while the sum is 49.
The square root of 4961499007 is about 70437.9088772516. The cubic root of 4961499007 is about 1705.5755812491.
The spelling of 4961499007 in words is "four billion, nine hundred sixty-one million, four hundred ninety-nine thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •