Search a number
-
+
16150253361 = 311489401617
BaseRepresentation
bin11110000101010000…
…10100111100110001
31112200112112212122220
433002220110330301
5231033431101421
611230323551253
71111134613524
oct170250247461
945615485586
1016150253361
116938440430
12316882b529
1316a4c43548
14ad2cc4bbb
15647cc53c6
hex3c2a14f31

16150253361 has 8 divisors (see below), whose sum is σ = 23491277664. Its totient is φ = 9788032320.

The previous prime is 16150253309. The next prime is 16150253363. The reversal of 16150253361 is 16335205161.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 16150253361 - 27 = 16150253233 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 489401617 = 16150253361 / (1 + 6 + 1 + 5 + 0 + 2 + 5 + 3 + 3 + 6 + 1).

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244700776 + ... + 244700841.

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

Almost surely, 216150253361 is an apocalyptic number.

16150253361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 489401631.

The product of its (nonzero) digits is 16200, while the sum is 33.

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

Divisors: 1 3 11 33 489401617 1468204851 5383417787 16150253361