Search a number
-
+
1356031321061 = 7119099032691
BaseRepresentation
bin10011101110111001110…
…000111110001111100101
311210122011011011110221112
4103232321300332033211
5134204123004233221
62514541401154405
7166653502022504
oct23567160761745
94718134143845
101356031321061
114830a9368aaa
1219a98418ba05
139ab4757b2a1
14498bcd1c83b
152541803d15b
hex13bb9c3e3e5

1356031321061 has 4 divisors (see below), whose sum is σ = 1375130353824. Its totient is φ = 1336932288300.

The previous prime is 1356031321027. The next prime is 1356031321063. The reversal of 1356031321061 is 1601231306531.

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 1356031321061 - 230 = 1354957579237 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 21356031321061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19099032762.

The product of its (nonzero) digits is 9720, while the sum is 32.

Adding to 1356031321061 its reverse (1601231306531), we get a palindrome (2957262627592).

The spelling of 1356031321061 in words is "one trillion, three hundred fifty-six billion, thirty-one million, three hundred twenty-one thousand, sixty-one".

Divisors: 1 71 19099032691 1356031321061