Base | Representation |
---|---|
bin | 101101001110000011… |
… | …111111111111111111 |
3 | 11122022211111121001222 |
4 | 231032003333333333 |
5 | 1243414400433204 |
6 | 34145555223555 |
7 | 3336135560666 |
oct | 551603777777 |
9 | 148284447058 |
10 | 48554311679 |
11 | 19656709015 |
12 | 94b08a7bbb |
13 | 476a3b5553 |
14 | 24c8727ddd |
15 | 13e29c7abe |
hex | b4e0fffff |
48554311679 has 2 divisors, whose sum is σ = 48554311680. Its totient is φ = 48554311678.
The previous prime is 48554311657. The next prime is 48554311697. The reversal of 48554311679 is 97611345584.
Together with next prime (48554311697) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48554311679 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48554311679.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48554311279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24277155839 + 24277155840.
It is an arithmetic number, because the mean of its divisors is an integer number (24277155840).
Almost surely, 248554311679 is an apocalyptic number.
48554311679 is a deficient number, since it is larger than the sum of its proper divisors (1).
48554311679 is an equidigital number, since it uses as much as digits as its factorization.
48554311679 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3628800, while the sum is 53.
The spelling of 48554311679 in words is "forty-eight billion, five hundred fifty-four million, three hundred eleven thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •