Search a number
-
+
1011001100131 = 111635323105929
BaseRepresentation
bin11101011011001000101…
…11001000011101100011
310120122120101221012211001
432231210113020131203
5113031012240201011
62052240354132431
7133020356363161
oct16554427103543
93518511835731
101011001100131
1135a843845290
12143b32281117
137444c4b9b49
1436d0b522231
151b4724717c1
hexeb645c8763

1011001100131 has 16 divisors (see below), whose sum is σ = 1109895557760. Its totient is φ = 913273081920.

The previous prime is 1011001100111. The next prime is 1011001100141. The reversal of 1011001100131 is 1310011001101.

It is a cyclic number.

It is not a de Polignac number, because 1011001100131 - 27 = 1011001100003 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (1011001100111) 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, 9491175 + ... + 9597103.

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

Almost surely, 21011001100131 is an apocalyptic number.

1011001100131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 111426.

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

Adding to 1011001100131 its reverse (1310011001101), we get a palindrome (2321012101232).

The spelling of 1011001100131 in words is "one trillion, eleven billion, one million, one hundred thousand, one hundred thirty-one".

Divisors: 1 11 163 1793 5323 58553 105929 867649 1165219 9544139 17266427 189930697 563860067 6202460737 91909190921 1011001100131