Base | Representation |
---|---|
bin | 1000111111111001… |
… | …01001011000101011 |
3 | 110110200022011002212 |
4 | 10133330221120223 |
5 | 34343211143042 |
6 | 2115212115335 |
7 | 230500322000 |
oct | 43774513053 |
9 | 13420264085 |
10 | 4830959147 |
11 | 2059a50123 |
12 | b29a65b4b |
13 | 5bcb24011 |
14 | 33b85b8a7 |
15 | 1d41b5482 |
hex | 11ff2962b |
4830959147 has 8 divisors (see below), whose sum is σ = 5633772000. Its totient is φ = 4140821832.
The previous prime is 4830959129. The next prime is 4830959149. The reversal of 4830959147 is 7419590384.
It is not a de Polignac number, because 4830959147 - 220 = 4829910571 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4830959095 and 4830959104.
It is not an unprimeable number, because it can be changed into a prime (4830959149) 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, 7041872 + ... + 7042557.
It is an arithmetic number, because the mean of its divisors is an integer number (704221500).
Almost surely, 24830959147 is an apocalyptic number.
4830959147 is a deficient number, since it is larger than the sum of its proper divisors (802812853).
4830959147 is an equidigital number, since it uses as much as digits as its factorization.
4830959147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14084450 (or 14084436 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 50.
The square root of 4830959147 is about 69505.1015897394. The cubic root of 4830959147 is about 1690.4842218549.
The spelling of 4830959147 in words is "four billion, eight hundred thirty million, nine hundred fifty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •