Search a number
-
+
140155430219969 is a prime number
BaseRepresentation
bin11111110111100001111010…
…101000011011000011000001
3200101020201122220121210212212
4133313201322220123003001
5121332301310114014334
61214030303224031505
741343616134252323
oct3767417250330301
9611221586553785
10140155430219969
1140726647572a9a
121387708a002595
1360287a5cb1168
1426877b7d2d613
151130b6eba4ece
hex7f787aa1b0c1

140155430219969 has 2 divisors, whose sum is σ = 140155430219970. Its totient is φ = 140155430219968.

The previous prime is 140155430219867. The next prime is 140155430220037. The reversal of 140155430219969 is 969912034551041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90666808135744 + 49488622084225 = 9521912^2 + 7034815^2 .

It is a cyclic number.

It is not a de Polignac number, because 140155430219969 - 28 = 140155430219713 is a prime.

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

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

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

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

Almost surely, 2140155430219969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 140155430219969 in words is "one hundred forty trillion, one hundred fifty-five billion, four hundred thirty million, two hundred nineteen thousand, nine hundred sixty-nine".