Search a number
-
+
131769033681 = 3192311737433
BaseRepresentation
bin111101010111000001…
…0111110001111010001
3110121010012200110121210
41322232002332033101
54124330333034211
6140311151410333
712343234206645
oct1725602761721
9417105613553
10131769033681
115097920333a
12216552239a9
13c56c541b1c
146540400c25
1536633019a6
hex1eae0be3d1

131769033681 has 8 divisors (see below), whose sum is σ = 184938994720. Its totient is φ = 83222547552.

The previous prime is 131769033679. The next prime is 131769033701. The reversal of 131769033681 is 186330967131.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 131769033681 - 21 = 131769033679 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2131769033681 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2311737455.

The product of its (nonzero) digits is 489888, while the sum is 48.

The spelling of 131769033681 in words is "one hundred thirty-one billion, seven hundred sixty-nine million, thirty-three thousand, six hundred eighty-one".

Divisors: 1 3 19 57 2311737433 6935212299 43923011227 131769033681