Search a number
-
+
15992714001 = 311484627697
BaseRepresentation
bin11101110010011110…
…10111001100010001
31112021120010001021210
432321033113030101
5230223113322001
611202535210333
71104212553225
oct167117271421
945246101253
1015992714001
116867519810
123123b169a9
13167b404aa4
14ab9dd6785
15639056dd6
hex3b93d7311

15992714001 has 8 divisors (see below), whose sum is σ = 23262129504. Its totient is φ = 9692553920.

The previous prime is 15992713987. The next prime is 15992714021. The reversal of 15992714001 is 10041729951.

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

It is a cyclic number.

It is not a de Polignac number, because 15992714001 - 211 = 15992711953 is a prime.

It is a super-2 number, since 2×159927140012 (a number of 21 digits) contains 22 as substring.

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

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

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

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

Almost surely, 215992714001 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 484627711.

The product of its (nonzero) digits is 22680, while the sum is 39.

The spelling of 15992714001 in words is "fifteen billion, nine hundred ninety-two million, seven hundred fourteen thousand, one".

Divisors: 1 3 11 33 484627697 1453883091 5330904667 15992714001