Search a number
-
+
17990915069 = 314774316619
BaseRepresentation
bin10000110000010101…
…111001001111111101
31201102211002011211202
4100300111321033331
5243321133240234
612133115425245
71204555153301
oct206025711775
951384064752
1017990915069
1176a2447856
1235a1155225
13190939c39a
14c29543d01
157046b177e
hex4305793fd

17990915069 has 16 divisors (see below), whose sum is σ = 18993070080. Its totient is φ = 17016167280.

The previous prime is 17990915029. The next prime is 17990915179. The reversal of 17990915069 is 96051909971.

It is a cyclic number.

It is not a de Polignac number, because 17990915069 - 28 = 17990914813 is a prime.

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

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (17990915029) 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 15 ways as a sum of consecutive naturals, for example, 1074242 + ... + 1090860.

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

Almost surely, 217990915069 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17440.

The product of its (nonzero) digits is 1377810, while the sum is 56.

The spelling of 17990915069 in words is "seventeen billion, nine hundred ninety million, nine hundred fifteen thousand, sixty-nine".

Divisors: 1 31 47 743 1457 16619 23033 34921 515189 781093 1082551 12347917 24213883 382785427 580352099 17990915069