Base | Representation |
---|---|
bin | 1001001101010010… |
… | …11110101001100011 |
3 | 110202111211110121000 |
4 | 10212221132221203 |
5 | 40111000444242 |
6 | 2134305403043 |
7 | 233333664600 |
oct | 44651365143 |
9 | 13674743530 |
10 | 4943374947 |
11 | 2107451845 |
12 | b5b639483 |
13 | 60a1c3b44 |
14 | 34c7616a7 |
15 | 1ddebda4c |
hex | 126a5ea63 |
4943374947 has 36 divisors (see below), whose sum is σ = 8523604440. Its totient is φ = 2823324336.
The previous prime is 4943374927. The next prime is 4943374957. The reversal of 4943374947 is 7494733494.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 4943374947 - 212 = 4943370851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4943374893 and 4943374902.
It is not an unprimeable number, because it can be changed into a prime (4943374927) 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 35 ways as a sum of consecutive naturals, for example, 2556393 + ... + 2558325.
It is an arithmetic number, because the mean of its divisors is an integer number (236766790).
Almost surely, 24943374947 is an apocalyptic number.
4943374947 is a deficient number, since it is larger than the sum of its proper divisors (3580229493).
4943374947 is an frugal number, since it uses more digits than its factorization.
4943374947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3889 (or 1943 counting only the distinct ones).
The product of its digits is 9144576, while the sum is 54.
The square root of 4943374947 is about 70309.1384316434. The cubic root of 4943374947 is about 1703.4962586801.
The spelling of 4943374947 in words is "four billion, nine hundred forty-three million, three hundred seventy-four thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •