Search a number
-
+
13154631603433 is a prime number
BaseRepresentation
bin1011111101101100110100…
…1001001101010011101001
31201120120101220010212121221
42333123031021031103221
53211011141142302213
643551053200302041
72525251014502555
oct277331511152351
951516356125557
1013154631603433
114211936666081
121585557611921
1374562696b908
1433698a97c865
1517c2aeb9d38d
hexbf6cd24d4e9

13154631603433 has 2 divisors, whose sum is σ = 13154631603434. Its totient is φ = 13154631603432.

The previous prime is 13154631603353. The next prime is 13154631603439. The reversal of 13154631603433 is 33430613645131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11060599759504 + 2094031843929 = 3325748^2 + 1447077^2 .

It is a cyclic number.

It is not a de Polignac number, because 13154631603433 - 213 = 13154631595241 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 13154631603433.

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

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

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

Almost surely, 213154631603433 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 13154631603433 in words is "thirteen trillion, one hundred fifty-four billion, six hundred thirty-one million, six hundred three thousand, four hundred thirty-three".