Search a number
-
+
13127015127 = 3197116719423
BaseRepresentation
bin11000011100110111…
…00101101011010111
31020212211210110110110
430032123211223113
5203341003441002
610010325254103
7643204534062
oct141633455327
936784713413
1013127015127
115626948836
122664264333
1313127b3995
148c758d8d9
1551c690e6c
hex30e6e5ad7

13127015127 has 32 divisors (see below), whose sum is σ = 18796216320. Its totient is φ = 8124611040.

The previous prime is 13127015113. The next prime is 13127015201. The reversal of 13127015127 is 72151072131.

It is not a de Polignac number, because 13127015127 - 232 = 8832047831 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 666138 + ... + 685560.

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

Almost surely, 213127015127 is an apocalyptic number.

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

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

13127015127 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 19683.

The product of its (nonzero) digits is 2940, while the sum is 30.

Adding to 13127015127 its reverse (72151072131), we get a palindrome (85278087258).

The spelling of 13127015127 in words is "thirteen billion, one hundred twenty-seven million, fifteen thousand, one hundred twenty-seven".

Divisors: 1 3 19 57 71 167 213 501 1349 3173 4047 9519 11857 19423 35571 58269 225283 369037 675849 1107111 1379033 3243641 4137099 9730923 26201627 61629179 78604881 184887537 230298511 690895533 4375671709 13127015127