Search a number
-
+
465141 = 3155047
BaseRepresentation
bin1110001100011110101
3212122001110
41301203311
5104341031
613545233
73645045
oct1614365
9778043
10465141
11298516
121a5219
13133941
14c1725
1592c46
hex718f5

465141 has 4 divisors (see below), whose sum is σ = 620192. Its totient is φ = 310092.

The previous prime is 465133. The next prime is 465151. The reversal of 465141 is 141564.

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 not a de Polignac number, because 465141 - 23 = 465133 is a prime.

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

It is a D-number.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (465151) 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, 77521 + ... + 77526.

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

2465141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 155050.

The product of its digits is 480, while the sum is 21.

The square root of 465141 is about 682.0124632292. The cubic root of 465141 is about 77.4809387739.

It can be divided in two parts, 465 and 141, that added together give a palindrome (606).

The spelling of 465141 in words is "four hundred sixty-five thousand, one hundred forty-one".

Divisors: 1 3 155047 465141