[go: up one dir, main page]

Search a number
-
+
11550022 = 211525001
BaseRepresentation
bin101100000011…
…110101000110
3210201210122121
4230003311012
510424100042
61051320154
7200113351
oct54036506
923653577
1011550022
116579780
123a5005a
132515243
141769298
151032367
hexb03d46

11550022 has 8 divisors (see below), whose sum is σ = 18900072. Its totient is φ = 5250000.

The previous prime is 11549983. The next prime is 11550029. The reversal of 11550022 is 22005511.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a zygodrome in base 10.

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

It is a congruent number.

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

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

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

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

Almost surely, 211550022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 525014.

The product of its (nonzero) digits is 100, while the sum is 16.

The square root of 11550022 is about 3398.5323302861. The cubic root of 11550022 is about 226.0446696886.

Adding to 11550022 its reverse (22005511), we get a palindrome (33555533).

The spelling of 11550022 in words is "eleven million, five hundred fifty thousand, twenty-two".

Divisors: 1 2 11 22 525001 1050002 5775011 11550022