Search a number
-
+
110010000001037 is a prime number
BaseRepresentation
bin11001000000110110110010…
…111110001100100000001101
3112102111212001001022110122212
4121000312302332030200031
5103404400440000013122
61025545521334320205
732112650232234533
oct3100666276144015
9472455031273585
10110010000001037
1132063a85055a64
12104088124b9065
13494cb8ac8c236
141d247260a4153
15cab92c5c0ce2
hex640db2f8c80d

110010000001037 has 2 divisors, whose sum is σ = 110010000001038. Its totient is φ = 110010000001036.

The previous prime is 110010000001009. The next prime is 110010000001051. The reversal of 110010000001037 is 730100000010011.

It is an a-pointer prime, because the next prime (110010000001051) can be obtained adding 110010000001037 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 78573580702276 + 31436419298761 = 8864174^2 + 5606819^2 .

It is a cyclic number.

It is not a de Polignac number, because 110010000001037 - 220 = 110009998952461 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110010000001037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21, while the sum is 14.

Adding to 110010000001037 its reverse (730100000010011), we get a palindrome (840110000011048).

The spelling of 110010000001037 in words is "one hundred ten trillion, ten billion, one thousand, thirty-seven".