Base | Representation |
---|---|
bin | 101101111000110010… |
… | …110001110111101111 |
3 | 11201011210111012011212 |
4 | 231320302301313233 |
5 | 1301401412431042 |
6 | 34345045105035 |
7 | 3362662303601 |
oct | 557062616757 |
9 | 151153435155 |
10 | 49271217647 |
11 | 19994355093 |
12 | 96709b817b |
13 | 4852a93972 |
14 | 2555a23171 |
15 | 14358d9482 |
hex | b78cb1def |
49271217647 has 6 divisors (see below), whose sum is σ = 50638864248. Its totient is φ = 47939561784.
The previous prime is 49271217641. The next prime is 49271217659. The reversal of 49271217647 is 74671217294.
It is not a de Polignac number, because 49271217647 - 210 = 49271216623 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49271217595 and 49271217604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49271217641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17993963 + ... + 17996700.
It is an arithmetic number, because the mean of its divisors is an integer number (8439810708).
Almost surely, 249271217647 is an apocalyptic number.
49271217647 is a deficient number, since it is larger than the sum of its proper divisors (1367646601).
49271217647 is an equidigital number, since it uses as much as digits as its factorization.
49271217647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35990737 (or 35990700 counting only the distinct ones).
The product of its digits is 1185408, while the sum is 50.
The spelling of 49271217647 in words is "forty-nine billion, two hundred seventy-one million, two hundred seventeen thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •