Base | Representation |
---|---|
bin | 101110001001010101… |
… | …100101001001111101 |
3 | 11201220010202121202010 |
4 | 232021111211021331 |
5 | 1302433441313221 |
6 | 34432402121433 |
7 | 3402602435031 |
oct | 561125451175 |
9 | 151803677663 |
10 | 49548776061 |
11 | 1a016aa0904 |
12 | 9729950279 |
13 | 4898434c05 |
14 | 25808341c1 |
15 | 144ee63c76 |
hex | b8956527d |
49548776061 has 32 divisors (see below), whose sum is σ = 71050608640. Its totient is φ = 30621919104.
The previous prime is 49548776009. The next prime is 49548776089. The reversal of 49548776061 is 16067784594.
It is not a de Polignac number, because 49548776061 - 27 = 49548775933 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49548775992 and 49548776010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49548772061) 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 31 ways as a sum of consecutive naturals, for example, 481566 + ... + 575328.
It is an arithmetic number, because the mean of its divisors is an integer number (2220331520).
Almost surely, 249548776061 is an apocalyptic number.
It is an amenable number.
49548776061 is a deficient number, since it is larger than the sum of its proper divisors (21501832579).
49548776061 is a wasteful number, since it uses less digits than its factorization.
49548776061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93985.
The product of its (nonzero) digits is 10160640, while the sum is 57.
The spelling of 49548776061 in words is "forty-nine billion, five hundred forty-eight million, seven hundred seventy-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •