Base | Representation |
---|---|
bin | 1001011010001100… |
… | …01000000111100001 |
3 | 111001001101020022011 |
4 | 10231012020013201 |
5 | 40321144020004 |
6 | 2153132112521 |
7 | 236116310365 |
oct | 45506100741 |
9 | 14031336264 |
10 | 5051548129 |
11 | 2162515971 |
12 | b8b905741 |
13 | 626739844 |
14 | 35cc7d2a5 |
15 | 1e873a004 |
hex | 12d1881e1 |
5051548129 has 4 divisors (see below), whose sum is σ = 5070188800. Its totient is φ = 5032907460.
The previous prime is 5051548091. The next prime is 5051548133. The reversal of 5051548129 is 9218451505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5051548129 - 29 = 5051547617 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5051548091 and 5051548100.
It is not an unprimeable number, because it can be changed into a prime (5051548189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9319929 + ... + 9320470.
It is an arithmetic number, because the mean of its divisors is an integer number (1267547200).
Almost surely, 25051548129 is an apocalyptic number.
It is an amenable number.
5051548129 is a deficient number, since it is larger than the sum of its proper divisors (18640671).
5051548129 is a wasteful number, since it uses less digits than its factorization.
5051548129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18640670.
The product of its (nonzero) digits is 72000, while the sum is 40.
The square root of 5051548129 is about 71074.2437807114. The cubic root of 5051548129 is about 1715.8322710900.
The spelling of 5051548129 in words is "five billion, fifty-one million, five hundred forty-eight thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •