Search a number
-
+
1010011161 = 3336670387
BaseRepresentation
bin111100001100111…
…000110000011001
32121101111212211210
4330030320300121
54032030324121
6244120013333
734012644645
oct7414706031
92541455753
101010011161
11479141375
12242301249
13131333b53
14981d5c25
155da0c876
hex3c338c19

1010011161 has 4 divisors (see below), whose sum is σ = 1346681552. Its totient is φ = 673340772.

The previous prime is 1010011111. The next prime is 1010011181. The reversal of 1010011161 is 1611100101.

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 1010011161 - 27 = 1010011033 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 21010011161 is an apocalyptic number.

It is an amenable number.

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

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

1010011161 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 336670390.

The product of its (nonzero) digits is 6, while the sum is 12.

The square root of 1010011161 is about 31780.6727587696. The cubic root of 1010011161 is about 1003.3259792645.

Adding to 1010011161 its reverse (1611100101), we get a palindrome (2621111262).

The spelling of 1010011161 in words is "one billion, ten million, eleven thousand, one hundred sixty-one".

Divisors: 1 3 336670387 1010011161