Search a number
-
+
101325169 = 119211379
BaseRepresentation
bin1100000101000…
…01100101110001
321001122212000001
412002201211301
5201414401134
614015430001
72340151441
oct602414561
9231585001
10101325169
1152217110
1229b25301
1317cb8a2a
14d658121
158d67414
hex60a1971

101325169 has 4 divisors (see below), whose sum is σ = 110536560. Its totient is φ = 92113780.

The previous prime is 101325167. The next prime is 101325173. The reversal of 101325169 is 961523101.

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 not a de Polignac number, because 101325169 - 21 = 101325167 is a prime.

It is a super-2 number, since 2×1013251692 = 20533579745757122, which contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (101325167) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4605679 + ... + 4605700.

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

Almost surely, 2101325169 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9211390.

The product of its (nonzero) digits is 1620, while the sum is 28.

The square root of 101325169 is about 10066.0403833881. The cubic root of 101325169 is about 466.2001893662.

The spelling of 101325169 in words is "one hundred one million, three hundred twenty-five thousand, one hundred sixty-nine".

Divisors: 1 11 9211379 101325169