Base | Representation |
---|---|
bin | 101101100011000011… |
… | …010000010011101101 |
3 | 11200020101002110101201 |
4 | 231203003100103231 |
5 | 1300130022002434 |
6 | 34244534405501 |
7 | 3350642601652 |
oct | 554303202355 |
9 | 150211073351 |
10 | 48906437869 |
11 | 198174556a3 |
12 | 958a800891 |
13 | 47c5334443 |
14 | 251d3c9c29 |
15 | 1413881614 |
hex | b630d04ed |
48906437869 has 2 divisors, whose sum is σ = 48906437870. Its totient is φ = 48906437868.
The previous prime is 48906437861. The next prime is 48906437927. The reversal of 48906437869 is 96873460984.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40338714025 + 8567723844 = 200845^2 + 92562^2 .
It is a cyclic number.
It is not a de Polignac number, because 48906437869 - 23 = 48906437861 is a prime.
It is a super-2 number, since 2×489064378692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48906437869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48906437861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24453218934 + 24453218935.
It is an arithmetic number, because the mean of its divisors is an integer number (24453218935).
Almost surely, 248906437869 is an apocalyptic number.
It is an amenable number.
48906437869 is a deficient number, since it is larger than the sum of its proper divisors (1).
48906437869 is an equidigital number, since it uses as much as digits as its factorization.
48906437869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62705664, while the sum is 64.
The spelling of 48906437869 in words is "forty-eight billion, nine hundred six million, four hundred thirty-seven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •