Search a number
-
+
1010011111229 is a prime number
BaseRepresentation
bin11101011001010010101…
…10100111111100111101
310120120000102002120100102
432230221112213330331
5113022000321024404
62051554231210445
7132654005536151
oct16545126477475
93516012076312
101010011111229
1135a385a39a3a
121438b6816a25
13743223765b3
1436c55c5d061
151b4155bb71e
hexeb295a7f3d

1010011111229 has 2 divisors, whose sum is σ = 1010011111230. Its totient is φ = 1010011111228.

The previous prime is 1010011111177. The next prime is 1010011111243. The reversal of 1010011111229 is 9221111100101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 857657505604 + 152353605625 = 926098^2 + 390325^2 .

It is an emirp because it is prime and its reverse (9221111100101) is a distict prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 21010011111229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 20.

The spelling of 1010011111229 in words is "one trillion, ten billion, eleven million, one hundred eleven thousand, two hundred twenty-nine".