Base | Representation |
---|---|
bin | 1001000111000101… |
… | …10111111001011101 |
3 | 110121212212101020221 |
4 | 10203202313321131 |
5 | 40004133433314 |
6 | 2125205441341 |
7 | 232132314664 |
oct | 44342677135 |
9 | 13555771227 |
10 | 4891311709 |
11 | 2090021979 |
12 | b46110251 |
13 | 5cc4955ab |
14 | 34588bddb |
15 | 1d9637824 |
hex | 1238b7e5d |
4891311709 has 8 divisors (see below), whose sum is σ = 5061771000. Its totient is φ = 4720972032.
The previous prime is 4891311697. The next prime is 4891311713. The reversal of 4891311709 is 9071131984.
It can be written as a sum of positive squares in 4 ways, for example, as 486334809 + 4404976900 = 22053^2 + 66370^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 4891311709 - 213 = 4891303517 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4891311739) by changing a digit.
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, 57697 + ... + 114505.
It is an arithmetic number, because the mean of its divisors is an integer number (632721375).
Almost surely, 24891311709 is an apocalyptic number.
It is an amenable number.
4891311709 is a deficient number, since it is larger than the sum of its proper divisors (170459291).
4891311709 is a wasteful number, since it uses less digits than its factorization.
4891311709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59807.
The product of its (nonzero) digits is 54432, while the sum is 43.
The square root of 4891311709 is about 69937.9132445343. The cubic root of 4891311709 is about 1697.4947769777.
The spelling of 4891311709 in words is "four billion, eight hundred ninety-one million, three hundred eleven thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •