Search a number
-
+
1335411305131 = 5632371956137
BaseRepresentation
bin10011011011101100101…
…101110110101010101011
311201122221002222010201211
4103123230231312222223
5133334410243231011
62501251322453551
7165323510543131
oct23335455665253
94648832863654
101335411305131
1147538795a922
1219698a6642b7
1398c0c5ba327
14488c455d751
1524b0cb4db21
hex136ecb76aab

1335411305131 has 4 divisors (see below), whose sum is σ = 1337783261832. Its totient is φ = 1333039348432.

The previous prime is 1335411305113. The next prime is 1335411305159. The reversal of 1335411305131 is 1315031145331.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1335411305131 - 219 = 1335410780843 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1335411305093 and 1335411305102.

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

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

Almost surely, 21335411305131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2371956700.

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

The spelling of 1335411305131 in words is "one trillion, three hundred thirty-five billion, four hundred eleven million, three hundred five thousand, one hundred thirty-one".

Divisors: 1 563 2371956137 1335411305131