Search a number
-
+
13220113030 = 251322011303
BaseRepresentation
bin11000100111111101…
…01110101010000110
31021010022222022202221
430103332232222012
5204033322104110
610023452522554
7645415051405
oct142376565206
937108868687
1013220113030
115674455653
12268b48045a
131328b7b9b7
148d5aa563c
155259307da
hex313faea86

13220113030 has 8 divisors (see below), whose sum is σ = 23796203472. Its totient is φ = 5288045208.

The previous prime is 13220113007. The next prime is 13220113051. The reversal of 13220113030 is 3031102231.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 661005642 + ... + 661005661.

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

Almost surely, 213220113030 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1322011310.

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

Adding to 13220113030 its reverse (3031102231), we get a palindrome (16251215261).

The spelling of 13220113030 in words is "thirteen billion, two hundred twenty million, one hundred thirteen thousand, thirty".

Divisors: 1 2 5 10 1322011303 2644022606 6610056515 13220113030