[go: up one dir, main page]

Search a number
-
+
1969213 = 31139457
BaseRepresentation
bin111100000110000111101
310201001020211
413200300331
51001003323
6110112421
722511101
oct7406075
93631224
101969213
111125554
127ab711
1353c41c
14393901
1528d70d
hex1e0c3d

1969213 has 8 divisors (see below), whose sum is σ = 2051840. Its totient is φ = 1887840.

The previous prime is 1969207. The next prime is 1969223. The reversal of 1969213 is 3129691.

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

It is a cyclic number.

It is not a de Polignac number, because 1969213 - 25 = 1969181 is a prime.

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

It is a Duffinian number.

1969213 is a lucky number.

It is a congruent number.

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

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

21969213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 627.

The product of its digits is 2916, while the sum is 31.

The square root of 1969213 is about 1403.2864996144. The cubic root of 1969213 is about 125.3422726070.

It can be divided in two parts, 196 and 9213, that added together give a square (9409 = 972).

The spelling of 1969213 in words is "one million, nine hundred sixty-nine thousand, two hundred thirteen".

Divisors: 1 31 139 457 4309 14167 63523 1969213