Search a number
-
+
13301103013132 = 22112831068190091
BaseRepresentation
bin1100000110001110011110…
…0001010010110100001100
31202002120110201221102120211
43001203213201102310030
53220411124332410012
644142235315052204
72541654506106544
oct301434741226414
952076421842524
1013301103013132
114268a6998a0a0
1215a9a145a1064
1375639a1812cc
1433dac384c324
15180ed3ac46a7
hexc18e7852d0c

13301103013132 has 24 divisors (see below), whose sum is σ = 25482742834752. Its totient is φ = 6024592107600.

The previous prime is 13301103013129. The next prime is 13301103013147. The reversal of 13301103013132 is 23131030110331.

It is a Harshad number since it is a multiple of its sum of digits (22).

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

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

Almost surely, 213301103013132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 486, while the sum is 22.

Adding to 13301103013132 its reverse (23131030110331), we get a palindrome (36432133123463).

The spelling of 13301103013132 in words is "thirteen trillion, three hundred one billion, one hundred three million, thirteen thousand, one hundred thirty-two".

Divisors: 1 2 4 11 22 44 283 566 1132 3113 6226 12452 1068190091 2136380182 4272760364 11750091001 23500182002 47000364004 302297795753 604595591506 1209191183012 3325275753283 6650551506566 13301103013132