Search a number
-
+
10671102947 is a prime number
BaseRepresentation
bin10011111000000110…
…00001101111100011
31000112200120012022002
421330003001233203
5133323300243242
64522514434215
7525303610211
oct117403015743
930480505262
1010671102947
11458661764a
12209989296b
131010a4c8cb
14733337cb1
15426c73432
hex27c0c1be3

10671102947 has 2 divisors, whose sum is σ = 10671102948. Its totient is φ = 10671102946.

The previous prime is 10671102941. The next prime is 10671102973. The reversal of 10671102947 is 74920117601.

10671102947 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10671102947 - 214 = 10671086563 is a prime.

It is a super-2 number, since 2×106711029472 (a number of 21 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 10671102947.

It is not a weakly prime, because it can be changed into another prime (10671102941) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5335551473 + 5335551474.

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

Almost surely, 210671102947 is an apocalyptic number.

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

10671102947 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 21168, while the sum is 38.

The spelling of 10671102947 in words is "ten billion, six hundred seventy-one million, one hundred two thousand, nine hundred forty-seven".