Base | Representation |
---|---|
bin | 101101001011001000… |
… | …001110001011001101 |
3 | 11122012101212201001110 |
4 | 231023020032023031 |
5 | 1243314300233134 |
6 | 34141040202233 |
7 | 3335000301564 |
oct | 551310161315 |
9 | 148171781043 |
10 | 48505086669 |
11 | 19630947596 |
12 | 9498309379 |
13 | 476013bb20 |
14 | 24c1d92bdb |
15 | 13dd5027e9 |
hex | b4b20e2cd |
48505086669 has 32 divisors (see below), whose sum is σ = 70342110720. Its totient is φ = 29552294592.
The previous prime is 48505086659. The next prime is 48505086673. The reversal of 48505086669 is 96668050584.
It is a happy number.
It is not a de Polignac number, because 48505086669 - 228 = 48236651213 is a prime.
It is a super-2 number, since 2×485050866692 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48505086629) 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 in 31 ways as a sum of consecutive naturals, for example, 10759914 + ... + 10764420.
It is an arithmetic number, because the mean of its divisors is an integer number (2198190960).
Almost surely, 248505086669 is an apocalyptic number.
It is an amenable number.
48505086669 is a deficient number, since it is larger than the sum of its proper divisors (21837024051).
48505086669 is a wasteful number, since it uses less digits than its factorization.
48505086669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7209.
The product of its (nonzero) digits is 12441600, while the sum is 57.
The spelling of 48505086669 in words is "forty-eight billion, five hundred five million, eighty-six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •