Search a number
-
+
941000000149 = 1185545454559
BaseRepresentation
bin11011011000101111111…
…10001000001010010101
310022221212220111220001101
431230113332020022111
5110404132000001044
62000142303430101
7124661600012446
oct15542776101225
93287786456041
10941000000149
11333091a71840
12132456bb5331
136a974a78921
143378a7012cd
1519726be4cd4
hexdb17f88295

941000000149 has 4 divisors (see below), whose sum is σ = 1026545454720. Its totient is φ = 855454545580.

The previous prime is 941000000089. The next prime is 941000000221.

941000000149 is nontrivially palindromic in base 10.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 941000000149 - 221 = 940997902997 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (941000030149) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42772727269 + ... + 42772727290.

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

Almost surely, 2941000000149 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 85545454570.

The product of its (nonzero) digits is 1296, while the sum is 28.

It can be divided in two parts, 941000000 and 149, that added together give a palindrome (941000149).

The spelling of 941000000149 in words is "nine hundred forty-one billion, one hundred forty-nine", and thus it is an aban number.

Divisors: 1 11 85545454559 941000000149