Search a number
-
+
10954691907 = 33651563969
BaseRepresentation
bin10100011001111001…
…10101010101000011
31001021110012000012220
422030330311111003
5134413400120112
65011005022123
7535316226165
oct121474652503
931243160186
1010954691907
114711702195
122158854943
131057722a23
1475cc78935
15441ade98c
hex28cf35543

10954691907 has 4 divisors (see below), whose sum is σ = 14606255880. Its totient is φ = 7303127936.

The previous prime is 10954691879. The next prime is 10954691939. The reversal of 10954691907 is 70919645901.

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

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10954691907 - 26 = 10954691843 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10954691977) 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 in 3 ways as a sum of consecutive naturals, for example, 1825781982 + ... + 1825781987.

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

Almost surely, 210954691907 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3651563972.

The product of its (nonzero) digits is 612360, while the sum is 51.

The spelling of 10954691907 in words is "ten billion, nine hundred fifty-four million, six hundred ninety-one thousand, nine hundred seven".

Divisors: 1 3 3651563969 10954691907