Search a number
-
+
1010000100112 = 2463125006257
BaseRepresentation
bin11101011001010001011…
…00100111101100010000
310120112222122101010221021
432230220230213230100
5113021440011200422
62051553155205224
7132653513125603
oct16545054475420
93515878333837
101010000100112
1135a37a7a9143
121438b2ba6814
137431ccbc743
1436c545d433a
151b414643dc7
hexeb28b27b10

1010000100112 has 10 divisors (see below), whose sum is σ = 1956875193998. Its totient is φ = 505000050048.

The previous prime is 1010000100101. The next prime is 1010000100163. The reversal of 1010000100112 is 2110010000101.

It can be written as a sum of positive squares in only one way, i.e., 973490062336 + 36510037776 = 986656^2 + 191076^2 .

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

It is an unprimeable number.

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

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

Almost surely, 21010000100112 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 63125006265 (or 63125006259 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 1010000100112 its reverse (2110010000101), we get a palindrome (3120010100213).

The spelling of 1010000100112 in words is "one trillion, ten billion, one hundred thousand, one hundred twelve".

Divisors: 1 2 4 8 16 63125006257 126250012514 252500025028 505000050056 1010000100112