Search a number
-
+
11010001012 = 222752500253
BaseRepresentation
bin10100100000011111…
…10100100001110100
31001102022021000001021
422100033310201310
5140022030013022
65020302310524
7536560315213
oct122017644164
931368230037
1011010001012
11473a94979a
122173288444
1310660197ca
1476635507a
154468b77c7
hex2903f4874

11010001012 has 6 divisors (see below), whose sum is σ = 19267501778. Its totient is φ = 5505000504.

The previous prime is 11010001007. The next prime is 11010001019. The reversal of 11010001012 is 21010001011.

It can be written as a sum of positive squares in only one way, i.e., 6822099216 + 4187901796 = 82596^2 + 64714^2 .

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

It is a congruent number.

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

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

Almost surely, 211010001012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11010001012 its reverse (21010001011), we get a palindrome (32020002023).

Subtracting 11010001012 from its reverse (21010001011), we obtain a palindrome (9999999999).

The spelling of 11010001012 in words is "eleven billion, ten million, one thousand, twelve".

Divisors: 1 2 4 2752500253 5505000506 11010001012