Search a number
-
+
11010131505629 = 34731729485607
BaseRepresentation
bin1010000000110111111011…
…1110100011000111011101
31102222120001222212111020122
42200031332332203013131
52420342222131140004
635225552400524325
72214312215436524
oct240157676430735
942876058774218
1011010131505629
113565409224063
121299a069206a5
1361b3354363b9
142a0c70d6b4bb
151415ead91cbe
hexa037efa31dd

11010131505629 has 4 divisors (see below), whose sum is σ = 11041860991584. Its totient is φ = 10978402019676.

The previous prime is 11010131505619. The next prime is 11010131505641. The reversal of 11010131505629 is 92650513101011.

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 11010131505629 - 24 = 11010131505613 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 (11010131505619) 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, 15864742457 + ... + 15864743150.

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

Almost surely, 211010131505629 is an apocalyptic number.

It is an amenable number.

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

11010131505629 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 31729485954.

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

The spelling of 11010131505629 in words is "eleven trillion, ten billion, one hundred thirty-one million, five hundred five thousand, six hundred twenty-nine".

Divisors: 1 347 31729485607 11010131505629