Search a number
-
+
11015004061231 is a prime number
BaseRepresentation
bin1010000001001010000101…
…1001110111111000101111
31110000000122120102221221221
42200102201121313320233
52420432212014424411
635232120100404211
72214544032456142
oct240224131677057
943000576387857
1011015004061231
1135674896a5215
12129a9466a6667
1361b930a627b1
142a11b4136059
151417d3a22071
hexa04a1677e2f

11015004061231 has 2 divisors, whose sum is σ = 11015004061232. Its totient is φ = 11015004061230.

The previous prime is 11015004061183. The next prime is 11015004061247. The reversal of 11015004061231 is 13216040051011.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11015004061231 - 227 = 11014869843503 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 211015004061231 is an apocalyptic number.

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

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

11015004061231 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 720, while the sum is 25.

The spelling of 11015004061231 in words is "eleven trillion, fifteen billion, four million, sixty-one thousand, two hundred thirty-one".