Search a number
-
+
32111120330 = 253211112033
BaseRepresentation
bin11101111001111110…
…001100111111001010
310001212212201221000222
4131321332030333022
51011230421322310
622430204430042
72214513006422
oct357176147712
9101785657028
1032111120330
1112688987a83
126281b48322
133049877723
1417a898b482
15c7e13b055
hex779f8cfca

32111120330 has 8 divisors (see below), whose sum is σ = 57800016612. Its totient is φ = 12844448128.

The previous prime is 32111120323. The next prime is 32111120339. The reversal of 32111120330 is 3302111123.

It can be written as a sum of positive squares in 2 ways, for example, as 30953827969 + 1157292361 = 175937^2 + 34019^2 .

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

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

It is a junction number, because it is equal to n+sod(n) for n = 32111120299 and 32111120308.

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

Almost surely, 232111120330 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3211112040.

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 32111120330 its reverse (3302111123), we get a palindrome (35413231453).

The spelling of 32111120330 in words is "thirty-two billion, one hundred eleven million, one hundred twenty thousand, three hundred thirty".

Divisors: 1 2 5 10 3211112033 6422224066 16055560165 32111120330