Search a number
-
+
48576601 is a prime number
BaseRepresentation
bin1011100101001…
…1100001011001
310101101221120101
42321103201121
544413422401
64453055401
71126615513
oct271234131
9111357511
1048576601
1125469357
1214327561
13a0aa568
146646bb3
1543e8101
hex2e53859

48576601 has 2 divisors, whose sum is σ = 48576602. Its totient is φ = 48576600.

The previous prime is 48576589. The next prime is 48576607. The reversal of 48576601 is 10667584.

48576601 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 can be written as a sum of positive squares in only one way, i.e., 45549001 + 3027600 = 6749^2 + 1740^2 .

It is a cyclic number.

It is not a de Polignac number, because 48576601 - 25 = 48576569 is a prime.

It is a super-3 number, since 3×485766013 (a number of 24 digits) contains 333 as substring.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (48576607) 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, 24288300 + 24288301.

It is an arithmetic number, because the mean of its divisors is an integer number (24288301).

Almost surely, 248576601 is an apocalyptic number.

It is an amenable number.

48576601 is a deficient number, since it is larger than the sum of its proper divisors (1).

48576601 is an equidigital number, since it uses as much as digits as its factorization.

48576601 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 40320, while the sum is 37.

The square root of 48576601 is about 6969.6916000638. The cubic root of 48576601 is about 364.8735434831.

The spelling of 48576601 in words is "forty-eight million, five hundred seventy-six thousand, six hundred one".