Base | Representation |
---|---|
bin | 101100110010100011… |
… | …101010010000111001 |
3 | 11121010200011212120101 |
4 | 230302203222100321 |
5 | 1241443232133314 |
6 | 34032112355401 |
7 | 3321533321236 |
oct | 546243522071 |
9 | 147120155511 |
10 | 48092849209 |
11 | 1943a183479 |
12 | 93a2245b61 |
13 | 46c5904432 |
14 | 248332478d |
15 | 13b7223174 |
hex | b328ea439 |
48092849209 has 2 divisors, whose sum is σ = 48092849210. Its totient is φ = 48092849208.
The previous prime is 48092849201. The next prime is 48092849239. The reversal of 48092849209 is 90294829084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48022339600 + 70509609 = 219140^2 + 8397^2 .
It is a cyclic number.
It is not a de Polignac number, because 48092849209 - 23 = 48092849201 is a prime.
It is a super-3 number, since 3×480928492093 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 48092849209.
It is not a weakly prime, because it can be changed into another prime (48092849201) 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, 24046424604 + 24046424605.
It is an arithmetic number, because the mean of its divisors is an integer number (24046424605).
Almost surely, 248092849209 is an apocalyptic number.
It is an amenable number.
48092849209 is a deficient number, since it is larger than the sum of its proper divisors (1).
48092849209 is an equidigital number, since it uses as much as digits as its factorization.
48092849209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2985984, while the sum is 55.
The spelling of 48092849209 in words is "forty-eight billion, ninety-two million, eight hundred forty-nine thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •