Search a number
BaseRepresentation
bin10011000101000011101…
…101011100010001010110
311122100011212212020112211
4103011003231130101112
5132440113324323110
62442151140504034
7163503206500126
oct23050355342126
94570155766484
101311101011030
11466042382078
121921250ab01a
1396836c2a815
1447659a30c86
15241887b898a
hex13143b5c456

1311101011030 has 16 divisors (see below), whose sum is σ = 2484191389680. Its totient is φ = 496838277792.

The previous prime is 1311101011019. The next prime is 1311101011067. The reversal of 1311101011030 is 301101011131.

Adding to 1311101011030 its reverse (301101011131), we get a palindrome (1612202022161).

It can be divided in two parts, 131110101 and 1030, that added together give a palindrome (131111131).

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

It is a self number, because there is not a number n which added to its sum of digits gives 1311101011030.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3450265629 + ... + 3450266008.

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

Almost surely, 21311101011030 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 6900531663.

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

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