Search a number
-
+
1001105111013 = 37291643850757
BaseRepresentation
bin11101001000101101000…
…00111011011111100101
310112201000201212212210120
432210112200323133211
5112400230402023023
62043522404512153
7132220214020020
oct16442640733745
93481021785716
101001105111013
11356625811187
121420300ab659
1373533218997
143664d1161b7
151b0937ab8e3
hexe91683b7e5

1001105111013 has 16 divisors (see below), whose sum is σ = 1578096727680. Its totient is φ = 552333854016.

The previous prime is 1001105111011. The next prime is 1001105111023. The reversal of 1001105111013 is 3101115011001.

It is not a de Polignac number, because 1001105111013 - 21 = 1001105111011 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 821924770 + ... + 821925987.

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

Almost surely, 21001105111013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1643850796.

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

The spelling of 1001105111013 in words is "one trillion, one billion, one hundred five million, one hundred eleven thousand, thirteen".

Divisors: 1 3 7 21 29 87 203 609 1643850757 4931552271 11506955299 34520865897 47671671953 143015015859 333701703671 1001105111013