Search a number
-
+
14948970581 is a prime number
BaseRepresentation
bin11011110110000011…
…10011000001010101
31102120211010101111002
431323001303001111
5221103414024311
610511212153045
71036310103416
oct157301630125
942524111432
1014948970581
116381338946
122a92468785
1315430c022c
14a1b53d80d
155c75d493b
hex37b073055

14948970581 has 2 divisors, whose sum is σ = 14948970582. Its totient is φ = 14948970580.

The previous prime is 14948970559. The next prime is 14948970593. The reversal of 14948970581 is 18507984941.

14948970581 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 can be written as a sum of positive squares in only one way, i.e., 7644704356 + 7304266225 = 87434^2 + 85465^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14948970581 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214948970581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2903040, while the sum is 56.

The spelling of 14948970581 in words is "fourteen billion, nine hundred forty-eight million, nine hundred seventy thousand, five hundred eighty-one".