Search a number
-
+
101095816143613 is a prime number
BaseRepresentation
bin10110111111001000110100…
…001101011010001011111101
3111020221122222020201101000111
4112333020310031122023331
5101222323212413043423
6555002435441430021
730202634365523614
oct2677106415321375
9436848866641014
10101095816143613
112a237549717a15
12b40906833b311
1344543aa1a8545
141ad70c678687b
15ba4b02cce60d
hex5bf23435a2fd

101095816143613 has 2 divisors, whose sum is σ = 101095816143614. Its totient is φ = 101095816143612.

The previous prime is 101095816143611. The next prime is 101095816143733. The reversal of 101095816143613 is 316341618590101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96222503820249 + 4873312323364 = 9809307^2 + 2207558^2 .

It is a cyclic number.

It is not a de Polignac number, because 101095816143613 - 21 = 101095816143611 is a prime.

Together with 101095816143611, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101095816143611) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50547908071806 + 50547908071807.

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

Almost surely, 2101095816143613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 49.

The spelling of 101095816143613 in words is "one hundred one trillion, ninety-five billion, eight hundred sixteen million, one hundred forty-three thousand, six hundred thirteen".