Search a number
-
+
645363507 = 3215121169
BaseRepresentation
bin100110011101110…
…111011100110011
31122222100212022010
4212131313130303
52310203113012
6144012214003
721664333155
oct4635673463
91588325263
10645363507
11301322178
1216016a303
13a391c7c9
14619d4ad5
153b9cdc3c
hex26777733

645363507 has 4 divisors (see below), whose sum is σ = 860484680. Its totient is φ = 430242336.

The previous prime is 645363491. The next prime is 645363559. The reversal of 645363507 is 705363546.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 645363507 - 24 = 645363491 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107560582 + ... + 107560587.

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

Almost surely, 2645363507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 215121172.

The product of its (nonzero) digits is 226800, while the sum is 39.

The square root of 645363507 is about 25404.0057274439. The cubic root of 645363507 is about 864.1745416943.

Adding to 645363507 its sum of digits (39), we get a palindrome (645363546).

The spelling of 645363507 in words is "six hundred forty-five million, three hundred sixty-three thousand, five hundred seven".

Divisors: 1 3 215121169 645363507