Search a number
-
+
133040611361 = 7231376031673
BaseRepresentation
bin111101111100111010…
…1101010000000100001
3110201101211101022021102
41323321311222000201
54134431344030421
6141041254004145
712416604352340
oct1737165520041
9421354338242
10133040611361
1151470a58489
122194b046655
13c712b07c58
146621243b57
1536d9c7a60b
hex1ef9d6a021

133040611361 has 16 divisors (see below), whose sum is σ = 159815234304. Its totient is φ = 108280575744.

The previous prime is 133040611351. The next prime is 133040611367. The reversal of 133040611361 is 163116040331.

It is a cyclic number.

It is not a de Polignac number, because 133040611361 - 222 = 133036417057 is a prime.

It is not an unprimeable number, because it can be changed into a prime (133040611367) by changing a digit.

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 15 ways as a sum of consecutive naturals, for example, 2993780 + ... + 3037893.

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

Almost surely, 2133040611361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6031840.

The product of its (nonzero) digits is 3888, while the sum is 29.

Adding to 133040611361 its reverse (163116040331), we get a palindrome (296156651692).

The spelling of 133040611361 in words is "one hundred thirty-three billion, forty million, six hundred eleven thousand, three hundred sixty-one".

Divisors: 1 7 23 137 161 959 3151 22057 6031673 42221711 138728479 826339201 971099353 5784374407 19005801623 133040611361