Search a number
-
+
145463671481 is a prime number
BaseRepresentation
bin1000011101111001001…
…1110111101010111001
3111220110121120011000012
42013132103313222321
54340402144441411
6150454115151305
713336503543452
oct2073623675271
9456417504005
10145463671481
11567664a5417
12242375a5535
13109427c62bb
14707d10a129
153bb571718b
hex21de4f7ab9

145463671481 has 2 divisors, whose sum is σ = 145463671482. Its totient is φ = 145463671480.

The previous prime is 145463671477. The next prime is 145463671489. The reversal of 145463671481 is 184176364541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 144317171881 + 1146499600 = 379891^2 + 33860^2 .

It is a cyclic number.

It is not a de Polignac number, because 145463671481 - 22 = 145463671477 is a prime.

It is a super-2 number, since 2×1454636714812 (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (145463671489) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72731835740 + 72731835741.

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

Almost surely, 2145463671481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1935360, while the sum is 50.

The spelling of 145463671481 in words is "one hundred forty-five billion, four hundred sixty-three million, six hundred seventy-one thousand, four hundred eighty-one".