Base | Representation |
---|---|
bin | 101101010111111011… |
… | …101000011011100111 |
3 | 11122202101001212000222 |
4 | 231113323220123213 |
5 | 1244234242441101 |
6 | 34214232154555 |
7 | 3343216143032 |
oct | 552773503347 |
9 | 148671055028 |
10 | 48719890151 |
11 | 19731120629 |
12 | 9538238a5b |
13 | 47957aa18a |
14 | 250270a019 |
15 | 14022d301b |
hex | b57ee86e7 |
48719890151 has 2 divisors, whose sum is σ = 48719890152. Its totient is φ = 48719890150.
The previous prime is 48719890127. The next prime is 48719890157. The reversal of 48719890151 is 15109891784.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48719890151 - 230 = 47646148327 is a prime.
It is a super-3 number, since 3×487198901513 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48719890093 and 48719890102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48719890157) 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 as a sum of consecutive naturals, namely, 24359945075 + 24359945076.
It is an arithmetic number, because the mean of its divisors is an integer number (24359945076).
Almost surely, 248719890151 is an apocalyptic number.
48719890151 is a deficient number, since it is larger than the sum of its proper divisors (1).
48719890151 is an equidigital number, since it uses as much as digits as its factorization.
48719890151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 53.
The spelling of 48719890151 in words is "forty-eight billion, seven hundred nineteen million, eight hundred ninety thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.077 sec. • engine limits •