Search a number
-
+
1055995 = 5211199
BaseRepresentation
bin100000001110011111011
31222122112221
410001303323
5232242440
634344511
711655463
oct4016373
91878487
101055995
11661426
1242b137
132ac865
141d6ba3
1515cd4a
hex101cfb

1055995 has 4 divisors (see below), whose sum is σ = 1267200. Its totient is φ = 844792.

The previous prime is 1055981. The next prime is 1056007. The reversal of 1055995 is 5995501.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5995501 = 16973533.

It is a cyclic number.

It is not a de Polignac number, because 1055995 - 27 = 1055867 is a prime.

It is a super-2 number, since 2×10559952 = 2230250880050, which contains 22 as substring.

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

It is an unprimeable number.

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, 105595 + ... + 105604.

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

21055995 is an apocalyptic number.

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

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

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

The sum of its prime factors is 211204.

The product of its (nonzero) digits is 10125, while the sum is 34.

The square root of 1055995 is about 1027.6161734811. The cubic root of 1055995 is about 101.8327066719.

The spelling of 1055995 in words is "one million, fifty-five thousand, nine hundred ninety-five".

Divisors: 1 5 211199 1055995