Search a number
-
+
13080962714611 = 113183462175837
BaseRepresentation
bin1011111001011010011000…
…1000101100101111110011
31201022112020210010120110011
42332112212020230233303
53203304302423331421
643453151124315351
72520032310333211
oct276264610545763
951275223116404
1013080962714611
114193672483590
121573217b42b57
1373b6b63a433c
1433319c9a3cb1
1517a3ec41e4e1
hexbe5a622cbf3

13080962714611 has 16 divisors (see below), whose sum is σ = 14907943830528. Its totient is φ = 11369525565600.

The previous prime is 13080962714597. The next prime is 13080962714627. The reversal of 13080962714611 is 11641726908031.

It is a cyclic number.

It is not a de Polignac number, because 13080962714611 - 229 = 13080425843699 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (13080962714681) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 231059616 + ... + 231116221.

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

Almost surely, 213080962714611 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 462175962.

The product of its (nonzero) digits is 435456, while the sum is 49.

The spelling of 13080962714611 in words is "thirteen trillion, eighty billion, nine hundred sixty-two million, seven hundred fourteen thousand, six hundred eleven".

Divisors: 1 11 31 83 341 913 2573 28303 462175837 5083934207 14327450947 38360594471 157601960417 421966539181 1189178428601 13080962714611