Search a number
-
+
30929102092111 = 113693200984991
BaseRepresentation
bin1110000100001001111100…
…01001001011011101001111
311001111210102022012022000211
413002010332021023131033
513023220300113421421
6145440344445303251
76341360661022306
oct702047611133517
9131453368168024
1030929102092111
119944a5a8a1443
123576325864b27
1314347a924a0b2
1478cd9584743d
1538980c1b79e1
hex1c213e24b74f

30929102092111 has 8 divisors (see below), whose sum is σ = 30933152870400. Its totient is φ = 30925051570560.

The previous prime is 30929102092067. The next prime is 30929102092121. The reversal of 30929102092111 is 11129020192903.

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 30929102092111 - 27 = 30929102091983 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 230929102092111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 128369.

The product of its (nonzero) digits is 17496, while the sum is 40.

The spelling of 30929102092111 in words is "thirty trillion, nine hundred twenty-nine billion, one hundred two million, ninety-two thousand, one hundred eleven".

Divisors: 1 11369 32009 84991 363910321 966262679 2720476919 30929102092111