Search a number
-
+
110100001012 = 2227525000253
BaseRepresentation
bin110011010001001111…
…0001011000011110100
3101112012001120112222021
41212202132023003310
53300441100013022
6122325041042524
710645244365411
oct1464236130364
9345161515867
10110100001012
1142769642381
1219408326444
13a4c8140cc1
1454865b5108
152ce5c9c7c7
hex19a278b0f4

110100001012 has 6 divisors (see below), whose sum is σ = 192675001778. Its totient is φ = 55050000504.

The previous prime is 110100001009. The next prime is 110100001019. The reversal of 110100001012 is 210100001011.

It can be written as a sum of positive squares in only one way, i.e., 92998161936 + 17101839076 = 304956^2 + 130774^2 .

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110100001019) by changing a digit.

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

Almost surely, 2110100001012 is an apocalyptic number.

It is an amenable number.

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

110100001012 is a wasteful number, since it uses less digits than its factorization.

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

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

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

Adding to 110100001012 its reverse (210100001011), we get a palindrome (320200002023).

Subtracting 110100001012 from its reverse (210100001011), we obtain a palindrome (99999999999).

The spelling of 110100001012 in words is "one hundred ten billion, one hundred million, one thousand, twelve".

Divisors: 1 2 4 27525000253 55050000506 110100001012