Search a number
-
+
1016155141531 = 3607459161363
BaseRepresentation
bin11101100100101111001…
…00001111010110011011
310121010212121011122110021
432302113210033112123
5113122041204012111
62054452031131311
7133262162122015
oct16622744172633
93533777148407
101016155141531
11361a490a4932
12144b30373b37
1374a91230c9a
1437279c411b5
151b674ba4d71
hexec9790f59b

1016155141531 has 8 divisors (see below), whose sum is σ = 1016674824704. Its totient is φ = 1015635597480.

The previous prime is 1016155141523. The next prime is 1016155141541. The reversal of 1016155141531 is 1351415516101.

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

It is a cyclic number.

It is not a de Polignac number, because 1016155141531 - 23 = 1016155141523 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21016155141531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 69561.

The product of its (nonzero) digits is 9000, while the sum is 34.

The spelling of 1016155141531 in words is "one trillion, sixteen billion, one hundred fifty-five million, one hundred forty-one thousand, five hundred thirty-one".

Divisors: 1 3607 4591 61363 16559737 221336341 281717533 1016155141531