Search a number
-
+
161010201211 = 1031563205837
BaseRepresentation
bin1001010111110011110…
…1001011001001111011
3120101121002002200112121
42111330331023021323
510114222102414321
6201544515222111
714426661062146
oct2257475131173
9511532080477
10161010201211
11623140742a2
1227255ba7937
131224c639112
147b15b5905d
1542c54d6441
hex257cf4b27b

161010201211 has 4 divisors (see below), whose sum is σ = 162573407152. Its totient is φ = 159446995272.

The previous prime is 161010201193. The next prime is 161010201271. The reversal of 161010201211 is 112102010161.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-161010201211 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2161010201211 is an apocalyptic number.

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

161010201211 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1563205940.

The product of its (nonzero) digits is 24, while the sum is 16.

Adding to 161010201211 its reverse (112102010161), we get a palindrome (273112211372).

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

Divisors: 1 103 1563205837 161010201211