Search a number
-
+
10671043341 = 372243226547
BaseRepresentation
bin10011111000000101…
…10011001100001101
31000112200110011112110
421330002303030031
5133323241341331
64522513254233
7525303241350
oct117402631415
930480404473
1010671043341
114586586892
122099864379
131010a2b73a
14733320297
15426c60946
hex27c0b330d

10671043341 has 16 divisors (see below), whose sum is σ = 16267958784. Its totient is φ = 6094993584.

The previous prime is 10671043333. The next prime is 10671043351. The reversal of 10671043341 is 14334017601.

It is not a de Polignac number, because 10671043341 - 23 = 10671043333 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210671043341 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 228800.

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

It can be divided in two parts, 106710 and 43341, that added together give a palindrome (150051).

The spelling of 10671043341 in words is "ten billion, six hundred seventy-one million, forty-three thousand, three hundred forty-one".

Divisors: 1 3 7 21 2243 6729 15701 47103 226547 679641 1585829 4757487 508144921 1524434763 3557014447 10671043341