Search a number
-
+
13320002032 = 24832500127
BaseRepresentation
bin11000110011110111…
…10001100111110000
31021101021221012201121
430121323301213300
5204234410031112
610041421512024
7651040102111
oct143173614760
937337835647
1013320002032
115715880747
1226b8a12614
131343783b0c
14905068208
1552e5b2407
hex319ef19f0

13320002032 has 10 divisors (see below), whose sum is σ = 25807503968. Its totient is φ = 6660001008.

The previous prime is 13320002023. The next prime is 13320002051. The reversal of 13320002032 is 23020002331.

It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 832500127 = 13320002032 / (1 + 3 + 3 + 2 + 0 + 0 + 0 + 2 + 0 + 3 + 2).

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

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 as a sum of consecutive naturals, namely, 416250048 + ... + 416250079.

Almost surely, 213320002032 is an apocalyptic number.

It is an amenable number.

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

13320002032 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 832500135 (or 832500129 counting only the distinct ones).

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

Adding to 13320002032 its reverse (23020002331), we get a palindrome (36340004363).

The spelling of 13320002032 in words is "thirteen billion, three hundred twenty million, two thousand, thirty-two".

Divisors: 1 2 4 8 16 832500127 1665000254 3330000508 6660001016 13320002032