Search a number
-
+
148896961 = 301149451
BaseRepresentation
bin10001101111111…
…11110011000001
3101101011202020021
420313333303001
5301104200321
622435213441
73455413633
oct1067776301
9341152207
10148896961
1177059544
1241a47281
1324b03b15
1415abca53
15d112941
hex8dffcc1

148896961 has 4 divisors (see below), whose sum is σ = 148949424. Its totient is φ = 148844500.

The previous prime is 148896949. The next prime is 148896967. The reversal of 148896961 is 169698841.

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 148896961 - 27 = 148896833 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 148896899 and 148896908.

It is not an unprimeable number, because it can be changed into a prime (148896967) 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 3 ways as a sum of consecutive naturals, for example, 21715 + ... + 27736.

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

Almost surely, 2148896961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 52462.

The product of its digits is 746496, while the sum is 52.

The square root of 148896961 is about 12202.3342439060. The cubic root of 148896961 is about 530.0236859000.

The spelling of 148896961 in words is "one hundred forty-eight million, eight hundred ninety-six thousand, nine hundred sixty-one".

Divisors: 1 3011 49451 148896961