Search a number
-
+
1302830661131 = 12613103292687
BaseRepresentation
bin10010111101010110110…
…000100011111000001011
311121112211111201221022022
4102331112300203320023
5132321144122124011
62434302342315055
7163061233620626
oct22752660437013
94545744657268
101302830661131
11462588a4185a
121905b7428a8b
1395b1969b55c
14470b34b0dbd
1523d526b98db
hex12f56c23e0b

1302830661131 has 4 divisors (see below), whose sum is σ = 1302933966432. Its totient is φ = 1302727355832.

The previous prime is 1302830661103. The next prime is 1302830661133. The reversal of 1302830661131 is 1311660382031.

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 1302830661131 - 214 = 1302830644747 is a prime.

It is a super-2 number, since 2×13028306611312 (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 = 1302830661091 and 1302830661100.

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

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

Almost surely, 21302830661131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 103305300.

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

The spelling of 1302830661131 in words is "one trillion, three hundred two billion, eight hundred thirty million, six hundred sixty-one thousand, one hundred thirty-one".

Divisors: 1 12613 103292687 1302830661131