Search a number
-
+
10601155121 is a prime number
BaseRepresentation
bin10011101111110000…
…01100101000110001
31000100210221110220212
421313320030220301
5133202343430441
64511535313505
7523464221534
oct116770145061
930323843825
1010601155121
114550091827
12207a37b895
13ccc3cba6b
14727d2aa1b
15420a57eeb
hex277e0ca31

10601155121 has 2 divisors, whose sum is σ = 10601155122. Its totient is φ = 10601155120.

The previous prime is 10601155109. The next prime is 10601155139. The reversal of 10601155121 is 12155110601.

10601155121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10370570896 + 230584225 = 101836^2 + 15185^2 .

It is a cyclic number.

It is not a de Polignac number, because 10601155121 - 222 = 10596960817 is a prime.

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

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

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

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

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

Almost surely, 210601155121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 300, while the sum is 23.

Adding to 10601155121 its reverse (12155110601), we get a palindrome (22756265722).

The spelling of 10601155121 in words is "ten billion, six hundred one million, one hundred fifty-five thousand, one hundred twenty-one".