Search a number
-
+
141499145951 is a prime number
BaseRepresentation
bin1000001111001000000…
…0011001111011011111
3111112020022121101101022
42003302000121323133
54304242240132301
6145000453434355
713136323616132
oct2036200317337
9445208541338
10141499145951
1155011640739
122350b93b9bb
13104603455c7
146bc478c219
153a3264cd1b
hex20f2019edf

141499145951 has 2 divisors, whose sum is σ = 141499145952. Its totient is φ = 141499145950.

The previous prime is 141499145947. The next prime is 141499145993. The reversal of 141499145951 is 159541994141.

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

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 141499145951 - 22 = 141499145947 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (141499145351) 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, 70749572975 + 70749572976.

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

Almost surely, 2141499145951 is an apocalyptic number.

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

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

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

The product of its digits is 1166400, while the sum is 53.

The spelling of 141499145951 in words is "one hundred forty-one billion, four hundred ninety-nine million, one hundred forty-five thousand, nine hundred fifty-one".