Search a number
-
+
10131315246609 = 33377105082203
BaseRepresentation
bin1001001101101110000101…
…1100100100011000010001
31022212112200210000221121120
42103123201130210120101
52311442413200342414
633314132330312453
72063651302463004
oct223334134443021
938775623027546
1010131315246609
113256737374417
121177624b88729
135864c067598b
1427050316753b
151288134a92a9
hex936e1724611

10131315246609 has 4 divisors (see below), whose sum is σ = 13508420328816. Its totient is φ = 6754210164404.

The previous prime is 10131315246581. The next prime is 10131315246631. The reversal of 10131315246609 is 90664251313101.

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 10131315246609 - 225 = 10131281692177 is a prime.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (10131315246649) 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 3 ways as a sum of consecutive naturals, for example, 1688552541099 + ... + 1688552541104.

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

Almost surely, 210131315246609 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3377105082206.

The product of its (nonzero) digits is 116640, while the sum is 42.

The spelling of 10131315246609 in words is "ten trillion, one hundred thirty-one billion, three hundred fifteen million, two hundred forty-six thousand, six hundred nine".

Divisors: 1 3 3377105082203 10131315246609