Search a number
-
+
40161157248857 is a prime number
BaseRepresentation
bin10010010000110101111111…
…00000101111011101011001
312021012100222002201111022012
421020122333200233131121
520231000022223430412
6221225440403235305
711313355626051221
oct1110327740573531
9167170862644265
1040161157248857
11118842842a4447
124607602378b35
13195424750aa08
149cbb4b991081
15499a3d09cc22
hex2486bf82f759

40161157248857 has 2 divisors, whose sum is σ = 40161157248858. Its totient is φ = 40161157248856.

The previous prime is 40161157248703. The next prime is 40161157248871. The reversal of 40161157248857 is 75884275116104.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25065282562576 + 15095874686281 = 5006524^2 + 3885341^2 .

It is a cyclic number.

It is not a de Polignac number, because 40161157248857 - 234 = 40143977379673 is a prime.

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

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

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

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

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

Almost surely, 240161157248857 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 40161157248857 in words is "forty trillion, one hundred sixty-one billion, one hundred fifty-seven million, two hundred forty-eight thousand, eight hundred fifty-seven".