Base | Representation |
---|---|
bin | 101101101010001010… |
… | …010011001011011011 |
3 | 11200112200112212210001 |
4 | 231222022103023123 |
5 | 1300401041201042 |
6 | 34304435233431 |
7 | 3353621534200 |
oct | 555212231333 |
9 | 150480485701 |
10 | 49025725147 |
11 | 1987881aa23 |
12 | 9602748877 |
13 | 4813c6bb29 |
14 | 253119bca7 |
15 | 141e095bb7 |
hex | b6a2932db |
49025725147 has 12 divisors (see below), whose sum is σ = 57881121960. Its totient is φ = 41394852576.
The previous prime is 49025725139. The next prime is 49025725169. The reversal of 49025725147 is 74152752094.
It is not a de Polignac number, because 49025725147 - 23 = 49025725139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49025725097 and 49025725106.
It is not an unprimeable number, because it can be changed into a prime (49025725117) 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 11 ways as a sum of consecutive naturals, for example, 7463322 + ... + 7469887.
It is an arithmetic number, because the mean of its divisors is an integer number (4823426830).
Almost surely, 249025725147 is an apocalyptic number.
49025725147 is a deficient number, since it is larger than the sum of its proper divisors (8855396813).
49025725147 is a wasteful number, since it uses less digits than its factorization.
49025725147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14933290 (or 14933283 counting only the distinct ones).
The product of its (nonzero) digits is 705600, while the sum is 46.
The spelling of 49025725147 in words is "forty-nine billion, twenty-five million, seven hundred twenty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •