Search a number
-
+
465640435 = 5138980491
BaseRepresentation
bin11011110000010…
…001101111110011
31012110011222121001
4123300101233303
51423200443220
6114112142431
714352610201
oct3360215763
91173158531
10465640435
11219929607
1210bb37a17
13756149b0
1445bb0071
152ad2c80a
hex1bc11bf3

465640435 has 16 divisors (see below), whose sum is σ = 608519520. Its totient is φ = 339989760.

The previous prime is 465640433. The next prime is 465640447. The reversal of 465640435 is 534046564.

It is not a de Polignac number, because 465640435 - 21 = 465640433 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34461 + ... + 46030.

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

Almost surely, 2465640435 is an apocalyptic number.

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

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

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

The sum of its prime factors is 80598.

The product of its (nonzero) digits is 172800, while the sum is 37.

The square root of 465640435 is about 21578.7032742934. The cubic root of 465640435 is about 775.0866001042.

Adding to 465640435 its reverse (534046564), we get a palindrome (999686999).

The spelling of 465640435 in words is "four hundred sixty-five million, six hundred forty thousand, four hundred thirty-five".

Divisors: 1 5 13 65 89 445 1157 5785 80491 402455 1046383 5231915 7163699 35818495 93128087 465640435