Base | Representation |
---|---|
bin | 101101000000000010… |
… | …111011101000110001 |
3 | 11121201110000011202220 |
4 | 231000002323220301 |
5 | 1242424200310031 |
6 | 34110355031253 |
7 | 3330252001206 |
oct | 550002735061 |
9 | 147643004686 |
10 | 48319150641 |
11 | 195459a0053 |
12 | 9445b9b529 |
13 | 473076a0c8 |
14 | 24a53d1cad |
15 | 13cc025596 |
hex | b400bba31 |
48319150641 has 16 divisors (see below), whose sum is σ = 65089907520. Its totient is φ = 31882222080.
The previous prime is 48319150613. The next prime is 48319150669. The reversal of 48319150641 is 14605191384.
It is an interprime number because it is at equal distance from previous prime (48319150613) and next prime (48319150669).
It is not a de Polignac number, because 48319150641 - 29 = 48319150129 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 48319150593 and 48319150602.
It is not an unprimeable number, because it can be changed into a prime (48319150441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87156 + ... + 322853.
It is an arithmetic number, because the mean of its divisors is an integer number (4068119220).
Almost surely, 248319150641 is an apocalyptic number.
It is an amenable number.
48319150641 is a deficient number, since it is larger than the sum of its proper divisors (16770756879).
48319150641 is a wasteful number, since it uses less digits than its factorization.
48319150641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410416.
The product of its (nonzero) digits is 103680, while the sum is 42.
The spelling of 48319150641 in words is "forty-eight billion, three hundred nineteen million, one hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •