Search a number
-
+
145479650567 is a prime number
BaseRepresentation
bin1000011101111101000…
…0110100110100000111
3111220111201121222012012
42013133100310310013
54340420242304232
6150455445444435
713340056424636
oct2073720646407
9456451558165
10145479650567
1156774519779
1224240a1071b
1310945bcc494
1470812a951d
153bb6d219b2
hex21df434d07

145479650567 has 2 divisors, whose sum is σ = 145479650568. Its totient is φ = 145479650566.

The previous prime is 145479650527. The next prime is 145479650579. The reversal of 145479650567 is 765056974541.

145479650567 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is an emirp because it is prime and its reverse (765056974541) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 145479650567 - 28 = 145479650311 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (145479650527) 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 as a sum of consecutive naturals, namely, 72739825283 + 72739825284.

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

Almost surely, 2145479650567 is an apocalyptic number.

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

145479650567 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 31752000, while the sum is 59.

The spelling of 145479650567 in words is "one hundred forty-five billion, four hundred seventy-nine million, six hundred fifty thousand, five hundred sixty-seven".