Search a number
-
+
131416600463011 = 338943067900397
BaseRepresentation
bin11101111000010111001111…
…110010011100011010100011
3122020022022012211200222110001
4131320113033302130122203
5114211112144204304021
61143255541450120431
736452351604030043
oct3570271762343243
9566268184628401
10131416600463011
1138967515a35036
12128a5501720117
1358436bc473826
1424648513a3723
15102d6a9cae091
hex7785cfc9c6a3

131416600463011 has 8 divisors (see below), whose sum is σ = 131458576206960. Its totient is φ = 131374626612768.

The previous prime is 131416600462933. The next prime is 131416600463021. The reversal of 131416600463011 is 110364006614131.

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 131416600463011 - 213 = 131416600454819 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2131416600463011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 946853.

The product of its (nonzero) digits is 31104, while the sum is 37.

The spelling of 131416600463011 in words is "one hundred thirty-one trillion, four hundred sixteen billion, six hundred million, four hundred sixty-three thousand, eleven".

Divisors: 1 3389 43067 900397 145954063 3051445433 38777397599 131416600463011