Search a number
-
+
1201126104013 = 11109193282183
BaseRepresentation
bin10001011110101000101…
…100011101101111001101
311020211022112200010021111
4101132220230131233031
5124134401240312023
62315442324532021
7152531011300063
oct21365054355715
94224275603244
101201126104013
11423438410770
12174952851011
138935b9a8244
14421c5d00033
152139d9cb00d
hex117a8b1dbcd

1201126104013 has 4 divisors (see below), whose sum is σ = 1310319386208. Its totient is φ = 1091932821820.

The previous prime is 1201126103959. The next prime is 1201126104029. The reversal of 1201126104013 is 3104016211021.

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 1201126104013 - 229 = 1200589233101 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21201126104013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 109193282194.

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

The spelling of 1201126104013 in words is "one trillion, two hundred one billion, one hundred twenty-six million, one hundred four thousand, thirteen".

Divisors: 1 11 109193282183 1201126104013