Search a number
-
+
13994646567 = 31137103111117
BaseRepresentation
bin11010000100010010…
…10101110000100111
31100010022101201001020
431002021111300213
5212130112142232
610232401502223
71003541350566
oct150211256047
940108351036
1013994646567
115a31682110
122866941973
131420486275
1496a8c1bdd
1556d926e2c
hex342255c27

13994646567 has 32 divisors (see below), whose sum is σ = 20928167424. Its totient is φ = 8243625600.

The previous prime is 13994646559. The next prime is 13994646587. The reversal of 13994646567 is 76564649931.

It is a happy number.

It is not a de Polignac number, because 13994646567 - 23 = 13994646559 is a prime.

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

It is a congruent number.

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

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

Almost surely, 213994646567 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12199.

The product of its digits is 29393280, while the sum is 60.

The spelling of 13994646567 in words is "thirteen billion, nine hundred ninety-four million, six hundred forty-six thousand, five hundred sixty-seven".

Divisors: 1 3 11 33 37 111 407 1031 1221 3093 11117 11341 33351 34023 38147 114441 122287 366861 411329 419617 1233987 1258851 4524619 11461627 13573857 34384881 126077897 378233691 424080199 1272240597 4664882189 13994646567