Search a number
-
+
13010112001 = 103126311767
BaseRepresentation
bin11000001110111011…
…01000111000000001
31020120200211011112001
430013131220320001
5203121042041001
65550551504001
7640255061455
oct140735507001
936520734461
1013010112001
115576961787
122631088001
1312c4502533
148b5c3c665
1551229d001
hex307768e01

13010112001 has 4 divisors (see below), whose sum is σ = 13136423872. Its totient is φ = 12883800132.

The previous prime is 13010111993. The next prime is 13010112047. The reversal of 13010112001 is 10021101031.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 13010112001 - 23 = 13010111993 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63155781 + ... + 63155986.

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

Almost surely, 213010112001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 126311870.

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

Adding to 13010112001 its reverse (10021101031), we get a palindrome (23031213032).

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

Divisors: 1 103 126311767 13010112001