Search a number
-
+
100560154033 is a prime number
BaseRepresentation
bin101110110100111011…
…0100010110110110001
3100121120012200010010101
41131221312202312301
53121421344412113
6114110253032401
710156655130433
oct1355166426661
9317505603111
10100560154033
1139713649119
12175a5485701
139637896931
144c1d5d4653
1529384d62dd
hex1769da2db1

100560154033 has 2 divisors, whose sum is σ = 100560154034. Its totient is φ = 100560154032.

The previous prime is 100560154027. The next prime is 100560154049. The reversal of 100560154033 is 330451065001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100022285169 + 537868864 = 316263^2 + 23192^2 .

It is a cyclic number.

It is not a de Polignac number, because 100560154033 - 221 = 100558056881 is a prime.

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

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

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

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

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

Almost surely, 2100560154033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 28.

The spelling of 100560154033 in words is "one hundred billion, five hundred sixty million, one hundred fifty-four thousand, thirty-three".