Search a number
-
+
13251026505531 = 323297164639469
BaseRepresentation
bin1100000011010011111010…
…1110100100111100111011
31201220210012211011021021010
43000310332232210330323
53214101100241134111
644103234301445003
72535232534604553
oct300647656447473
951823184137233
1013251026505531
114249802010821
1215a0179b70763
13751749604a19
1433b4d2cc4163
1517ea5266aaa6
hexc0d3eba4f3b

13251026505531 has 16 divisors (see below), whose sum is σ = 18442416464640. Its totient is φ = 8447085678240.

The previous prime is 13251026505529. The next prime is 13251026505547. The reversal of 13251026505531 is 13550562015231.

It is not a de Polignac number, because 13251026505531 - 21 = 13251026505529 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 13251026505531.

It is not an unprimeable number, because it can be changed into a prime (13251026505131) 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, 32114736 + ... + 32524733.

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

Almost surely, 213251026505531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 64642466.

The product of its (nonzero) digits is 135000, while the sum is 39.

The spelling of 13251026505531 in words is "thirteen trillion, two hundred fifty-one billion, twenty-six million, five hundred five thousand, five hundred thirty-one".

Divisors: 1 3 23 69 2971 8913 68333 204999 64639469 193918407 1486707787 4460123361 192043862399 576131587197 4417008835177 13251026505531