Search a number
-
+
40367249320201 is a prime number
BaseRepresentation
bin10010010110110101110111…
…00011100110100100001001
312021221001221000022110121121
421023122323203212210021
520242334111311221301
6221504242555435241
711334303032544166
oct1113327343464411
9167831830273547
1040367249320201
1111953721961a51
12463b53a155b21
13196a7cc9c161b
149d7adcbab06d
154a00a12953a1
hex24b6bb8e6909

40367249320201 has 2 divisors, whose sum is σ = 40367249320202. Its totient is φ = 40367249320200.

The previous prime is 40367249320157. The next prime is 40367249320327. The reversal of 40367249320201 is 10202394276304.

40367249320201 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 can be written as a sum of positive squares in only one way, i.e., 38777720934976 + 1589528385225 = 6227176^2 + 1260765^2 .

It is a cyclic number.

It is not a de Polignac number, because 40367249320201 - 215 = 40367249287433 is a prime.

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

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

Almost surely, 240367249320201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 435456, while the sum is 43.

The spelling of 40367249320201 in words is "forty trillion, three hundred sixty-seven billion, two hundred forty-nine million, three hundred twenty thousand, two hundred one".