Base | Representation |
---|---|
bin | 1001001101100011… |
… | …01011110100100011 |
3 | 110202122212202100112 |
4 | 10212301223310203 |
5 | 40112023313201 |
6 | 2134423441535 |
7 | 233361164204 |
oct | 44661536443 |
9 | 13678782315 |
10 | 4945526051 |
11 | 2108690a14 |
12 | b602b62ab |
13 | 60a797c9b |
14 | 34cb615ab |
15 | 1de2960bb |
hex | 126c6bd23 |
4945526051 has 4 divisors (see below), whose sum is σ = 4945672392. Its totient is φ = 4945379712.
The previous prime is 4945526011. The next prime is 4945526057. The reversal of 4945526051 is 1506255494.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4945526051 is a prime.
It is a super-2 number, since 2×49455260512 = 48916455842239309202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4945526057) 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 3 ways as a sum of consecutive naturals, for example, 6275 + ... + 99651.
It is an arithmetic number, because the mean of its divisors is an integer number (1236418098).
Almost surely, 24945526051 is an apocalyptic number.
4945526051 is a deficient number, since it is larger than the sum of its proper divisors (146341).
4945526051 is an equidigital number, since it uses as much as digits as its factorization.
4945526051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146340.
The product of its (nonzero) digits is 216000, while the sum is 41.
The square root of 4945526051 is about 70324.4342387481. The cubic root of 4945526051 is about 1703.7433143363.
The spelling of 4945526051 in words is "four billion, nine hundred forty-five million, five hundred twenty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •