Base | Representation |
---|---|
bin | 10101110111010100101011… |
… | …10001111011010001110101 |
3 | 20022020102212010110010201211 |
4 | 22323222111301323101311 |
5 | 22300222102430220334 |
6 | 250131453054121421 |
7 | 13061456362451002 |
oct | 1273522561732165 |
9 | 208212763403654 |
10 | 48080376804469 |
11 | 14357856287139 |
12 | 5486370ab0271 |
13 | 20a9c633a3249 |
14 | bc316197a8a9 |
15 | 585a33281a64 |
hex | 2bba95c7b475 |
48080376804469 has 2 divisors, whose sum is σ = 48080376804470. Its totient is φ = 48080376804468.
The previous prime is 48080376804433. The next prime is 48080376804517. The reversal of 48080376804469 is 96440867308084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46306051571025 + 1774325233444 = 6804855^2 + 1332038^2 .
It is a cyclic number.
It is not a de Polignac number, because 48080376804469 - 217 = 48080376673397 is a prime.
It is a super-3 number, since 3×480803768044693 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48080376804409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24040188402234 + 24040188402235.
It is an arithmetic number, because the mean of its divisors is an integer number (24040188402235).
Almost surely, 248080376804469 is an apocalyptic number.
It is an amenable number.
48080376804469 is a deficient number, since it is larger than the sum of its proper divisors (1).
48080376804469 is an equidigital number, since it uses as much as digits as its factorization.
48080376804469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 222953472, while the sum is 67.
The spelling of 48080376804469 in words is "forty-eight trillion, eighty billion, three hundred seventy-six million, eight hundred four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •