Search a number
-
+
16150161051 = 331394303267
BaseRepresentation
bin11110000101001111…
…11110011010011011
31112200112101012001000
433002213332122123
5231033420123201
611230322000043
71111134050433
oct170247763233
945615335030
1016150161051
116938388042
1231687a6023
1316a4c1051b
14ad2c9d2c3
15647ca7d86
hex3c29fe69b

16150161051 has 16 divisors (see below), whose sum is σ = 24098300800. Its totient is φ = 10689312744.

The previous prime is 16150161031. The next prime is 16150161073. The reversal of 16150161051 is 15016105161.

It is not a de Polignac number, because 16150161051 - 213 = 16150152859 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2147881 + ... + 2155386.

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

Almost surely, 216150161051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4303415 (or 4303409 counting only the distinct ones).

The product of its (nonzero) digits is 900, while the sum is 27.

The spelling of 16150161051 in words is "sixteen billion, one hundred fifty million, one hundred sixty-one thousand, fifty-one".

Divisors: 1 3 9 27 139 417 1251 3753 4303267 12909801 38729403 116188209 598154113 1794462339 5383387017 16150161051