Base | Representation |
---|---|
bin | 10011010111101100010… |
… | …001111100110111000011 |
3 | 11201020211021110120101112 |
4 | 103113230101330313003 |
5 | 133302102402220141 |
6 | 2455300353553535 |
7 | 165112060004054 |
oct | 23275421746703 |
9 | 4636737416345 |
10 | 1331109023171 |
11 | 47357a3837a4 |
12 | 195b898758ab |
13 | 986a517c265 |
14 | 485d700072b |
15 | 2495a0b87eb |
hex | 135ec47cdc3 |
1331109023171 has 2 divisors, whose sum is σ = 1331109023172. Its totient is φ = 1331109023170.
The previous prime is 1331109023131. The next prime is 1331109023173. The reversal of 1331109023171 is 1713209011331.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331109023171 is a prime.
Together with 1331109023173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1331109023173) 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 as a sum of consecutive naturals, namely, 665554511585 + 665554511586.
It is an arithmetic number, because the mean of its divisors is an integer number (665554511586).
Almost surely, 21331109023171 is an apocalyptic number.
1331109023171 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331109023171 is an equidigital number, since it uses as much as digits as its factorization.
1331109023171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 32.
The spelling of 1331109023171 in words is "one trillion, three hundred thirty-one billion, one hundred nine million, twenty-three thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •