Base | Representation |
---|---|
bin | 10011010111101100011… |
… | …010000100001011110011 |
3 | 11201020211102110122021221 |
4 | 103113230122010023303 |
5 | 133302103423302243 |
6 | 2455300511325511 |
7 | 165112114043503 |
oct | 23275432041363 |
9 | 4636742418257 |
10 | 1331111150323 |
11 | 4735805a6979 |
12 | 195b8a520897 |
13 | 986a5745526 |
14 | 485d73d5a03 |
15 | 2495a388bed |
hex | 135ec6842f3 |
1331111150323 has 2 divisors, whose sum is σ = 1331111150324. Its totient is φ = 1331111150322.
The previous prime is 1331111150233. The next prime is 1331111150333. The reversal of 1331111150323 is 3230511111331.
Together with previous prime (1331111150233) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1331111150323 - 225 = 1331077595891 is a prime.
It is not a weakly prime, because it can be changed into another prime (1331111150333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665555575161 + 665555575162.
It is an arithmetic number, because the mean of its divisors is an integer number (665555575162).
Almost surely, 21331111150323 is an apocalyptic number.
1331111150323 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331111150323 is an equidigital number, since it uses as much as digits as its factorization.
1331111150323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
Adding to 1331111150323 its reverse (3230511111331), we get a palindrome (4561622261654).
The spelling of 1331111150323 in words is "one trillion, three hundred thirty-one billion, one hundred eleven million, one hundred fifty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •