[go: up one dir, main page]

Search a number
-
+
1013190 = 23533773
BaseRepresentation
bin11110111010111000110
31220110211120
43313113012
5224410230
633414410
711416623
oct3672706
91813746
101013190
11632252
1240a406
13296229
141c534a
15150310
hexf75c6

1013190 has 16 divisors (see below), whose sum is σ = 2431728. Its totient is φ = 270176.

The previous prime is 1013153. The next prime is 1013197. The reversal of 1013190 is 913101.

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

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16857 + ... + 16916.

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

21013190 is an apocalyptic number.

1013190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

1013190 is an abundant number, since it is smaller than the sum of its proper divisors (1418538).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 33783.

The product of its (nonzero) digits is 27, while the sum is 15.

The square root of 1013190 is about 1006.5733952375. The cubic root of 1013190 is about 100.4377476406.

Adding to 1013190 its reverse (913101), we get a palindrome (1926291).

The spelling of 1013190 in words is "one million, thirteen thousand, one hundred ninety".

Divisors: 1 2 3 5 6 10 15 30 33773 67546 101319 168865 202638 337730 506595 1013190