Search a number
-
+
15055401405113 is a prime number
BaseRepresentation
bin1101101100010101101111…
…0110100100101010111001
31222022021121210212100201122
43123011123312210222321
53433131430224430423
652004204513555025
73112500611313116
oct333053366445271
958267553770648
1015055401405113
114884a616661a3
121831a07575a75
138529450320b4
143a098471590d
151b195b3008c8
hexdb15bda4ab9

15055401405113 has 2 divisors, whose sum is σ = 15055401405114. Its totient is φ = 15055401405112.

The previous prime is 15055401405097. The next prime is 15055401405127. The reversal of 15055401405113 is 31150410455051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12898929714064 + 2156471691049 = 3591508^2 + 1468493^2 .

It is a cyclic number.

It is not a de Polignac number, because 15055401405113 - 24 = 15055401405097 is a prime.

It is a super-3 number, since 3×150554014051133 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 215055401405113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30000, while the sum is 35.

The spelling of 15055401405113 in words is "fifteen trillion, fifty-five billion, four hundred one million, four hundred five thousand, one hundred thirteen".