Base | Representation |
---|---|
bin | 101100111100100100… |
… | …100111111011100101 |
3 | 11121120101100102012012 |
4 | 230330210213323211 |
5 | 1242314240431312 |
6 | 34100514004005 |
7 | 3325643442302 |
oct | 547444477345 |
9 | 147511312165 |
10 | 48260873957 |
11 | 195160069aa |
12 | 942a576605 |
13 | 472167466a |
14 | 249b7820a9 |
15 | 13c6d63322 |
hex | b3c927ee5 |
48260873957 has 4 divisors (see below), whose sum is σ = 48285164256. Its totient is φ = 48236583660.
The previous prime is 48260873911. The next prime is 48260873993. The reversal of 48260873957 is 75937806284.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 48260873957 - 26 = 48260873893 is a prime.
It is a super-2 number, since 2×482608739572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48260873896 and 48260873905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48260873057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12142169 + ... + 12146142.
It is an arithmetic number, because the mean of its divisors is an integer number (12071291064).
Almost surely, 248260873957 is an apocalyptic number.
It is an amenable number.
48260873957 is a deficient number, since it is larger than the sum of its proper divisors (24290299).
48260873957 is a wasteful number, since it uses less digits than its factorization.
48260873957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24290298.
The product of its (nonzero) digits is 20321280, while the sum is 59.
The spelling of 48260873957 in words is "forty-eight billion, two hundred sixty million, eight hundred seventy-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •