Search a number
-
+
4101520455101 is a prime number
BaseRepresentation
bin111011101011110101101…
…010110111010110111101
3112112002202000100011110202
4323223311222313112331
51014144403214030401
612420113521413245
7602216333432246
oct73536552672675
915462660304422
104101520455101
111341499409133
12562a9aa9a225
13239a0560ca44
1410272c2a9ccd
1571a5393006b
hex3baf5ab75bd

4101520455101 has 2 divisors, whose sum is σ = 4101520455102. Its totient is φ = 4101520455100.

The previous prime is 4101520455089. The next prime is 4101520455143. The reversal of 4101520455101 is 1015540251014.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3963304548025 + 138215907076 = 1990805^2 + 371774^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-4101520455101 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 24101520455101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4000, while the sum is 29.

The spelling of 4101520455101 in words is "four trillion, one hundred one billion, five hundred twenty million, four hundred fifty-five thousand, one hundred one".