Search a number
-
+
901145336953 is a prime number
BaseRepresentation
bin11010001110100000111…
…00101001110001111001
310012011000100221020011111
431013100130221301321
5104231021201240303
61525551440000321
7122051135660221
oct15072034516171
93164010836144
10901145336953
113181a0060464
121267939000a1
1366c92b51894
1431889567081
1518692d6ab6d
hexd1d0729c79

901145336953 has 2 divisors, whose sum is σ = 901145336954. Its totient is φ = 901145336952.

The previous prime is 901145336947. The next prime is 901145336957. The reversal of 901145336953 is 359633541109.

It is a happy number.

901145336953 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., 482674783504 + 418470553449 = 694748^2 + 646893^2 .

It is a cyclic number.

It is not a de Polignac number, because 901145336953 - 229 = 900608466041 is a prime.

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

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

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

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

Almost surely, 2901145336953 is an apocalyptic number.

It is an amenable number.

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

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

901145336953 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1312200, while the sum is 49.

The spelling of 901145336953 in words is "nine hundred one billion, one hundred forty-five million, three hundred thirty-six thousand, nine hundred fifty-three".