Base | Representation |
---|---|
bin | 1011100100001… |
… | …1000011001001 |
3 | 10101021112000102 |
4 | 2321003003021 |
5 | 44404243004 |
6 | 4451415145 |
7 | 1126215014 |
oct | 271030311 |
9 | 111245012 |
10 | 48509129 |
11 | 25422699 |
12 | 142b44b5 |
13 | a085936 |
14 | 662a37b |
15 | 43d311e |
hex | 2e430c9 |
48509129 has 4 divisors (see below), whose sum is σ = 48551184. Its totient is φ = 48467076.
The previous prime is 48509119. The next prime is 48509159. The reversal of 48509129 is 92190584.
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 48509129 - 212 = 48505033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48509092 and 48509101.
It is not an unprimeable number, because it can be changed into a prime (48509119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19247 + ... + 21620.
It is an arithmetic number, because the mean of its divisors is an integer number (12137796).
Almost surely, 248509129 is an apocalyptic number.
It is an amenable number.
48509129 is a deficient number, since it is larger than the sum of its proper divisors (42055).
48509129 is a wasteful number, since it uses less digits than its factorization.
48509129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42054.
The product of its (nonzero) digits is 25920, while the sum is 38.
The square root of 48509129 is about 6964.8495317559. The cubic root of 48509129 is about 364.7045310069.
The spelling of 48509129 in words is "forty-eight million, five hundred nine thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •