Search a number
-
+
10541150947 is a prime number
BaseRepresentation
bin10011101000100110…
…10011001011100011
31000012122000221200001
421310103103023203
5133042013312242
64501553240431
7522135206335
oct116423231343
930178027601
1010541150947
11451a2287a8
122062263117
13cbcb4cc32
1471dd8b455
1541a653eb7
hex2744d32e3

10541150947 has 2 divisors, whose sum is σ = 10541150948. Its totient is φ = 10541150946.

The previous prime is 10541150941. The next prime is 10541150959. The reversal of 10541150947 is 74905114501.

10541150947 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 10541150947 - 27 = 10541150819 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10541150941) 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, 5270575473 + 5270575474.

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

Almost surely, 210541150947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 37.

The spelling of 10541150947 in words is "ten billion, five hundred forty-one million, one hundred fifty thousand, nine hundred forty-seven".