Base | Representation |
---|---|
bin | 1011101001001… |
… | …0000001110111 |
3 | 10101212221202222 |
4 | 2322102001313 |
5 | 100000121011 |
6 | 4502352555 |
7 | 1132033121 |
oct | 272220167 |
9 | 111787688 |
10 | 48832631 |
11 | 25623751 |
12 | 1442b75b |
13 | a169c63 |
14 | 66b2211 |
15 | 4448ddb |
hex | 2e92077 |
48832631 has 2 divisors, whose sum is σ = 48832632. Its totient is φ = 48832630.
The previous prime is 48832627. The next prime is 48832633. The reversal of 48832631 is 13623884.
It is a happy number.
48832631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48832631 - 22 = 48832627 is a prime.
It is a super-2 number, since 2×488326312 = 4769251700764322, which contains 22 as substring.
Together with 48832633, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 48832591 and 48832600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48832633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24416315 + 24416316.
It is an arithmetic number, because the mean of its divisors is an integer number (24416316).
Almost surely, 248832631 is an apocalyptic number.
48832631 is a deficient number, since it is larger than the sum of its proper divisors (1).
48832631 is an equidigital number, since it uses as much as digits as its factorization.
48832631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 35.
The square root of 48832631 is about 6988.0348453625. The cubic root of 48832631 is about 365.5134601299.
The spelling of 48832631 in words is "forty-eight million, eight hundred thirty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •