Search a number
-
+
1111001011012 = 22277750252753
BaseRepresentation
bin10000001010101100110…
…100100001001101000100
310221012200120102000211001
4100022230310201031010
5121200312224323022
62210215315223044
7143160432530644
oct20125464411504
93835616360731
101111001011012
1139919a11a432
1215b39bba7a84
13809c7c97b49
143bab655c524
151dd7668eb27
hex102acd21344

1111001011012 has 6 divisors (see below), whose sum is σ = 1944251769278. Its totient is φ = 555500505504.

The previous prime is 1111001011007. The next prime is 1111001011013. The reversal of 1111001011012 is 2101101001111.

It can be written as a sum of positive squares in only one way, i.e., 643823292996 + 467177718016 = 802386^2 + 683504^2 .

It is a super-2 number, since 2×11110010110122 (a number of 25 digits) contains 22 as substring.

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

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

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

Almost surely, 21111001011012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1111001011012 its reverse (2101101001111), we get a palindrome (3212102012123).

Subtracting 1111001011012 from its reverse (2101101001111), we obtain a palindrome (990099990099).

The spelling of 1111001011012 in words is "one trillion, one hundred eleven billion, one million, eleven thousand, twelve".

Divisors: 1 2 4 277750252753 555500505506 1111001011012