Base | Representation |
---|---|
bin | 10011010111100110101… |
… | …111101100000100101101 |
3 | 11201020120210201101210211 |
4 | 103113212233230010231 |
5 | 133301410113433222 |
6 | 2455243235302421 |
7 | 165106551435463 |
oct | 23274657540455 |
9 | 4636523641724 |
10 | 1331016155437 |
11 | 473531a13901 |
12 | 195b6274aa11 |
13 | 9868bb64c37 |
14 | 485c8948833 |
15 | 24951d72277 |
hex | 135e6bec12d |
1331016155437 has 2 divisors, whose sum is σ = 1331016155438. Its totient is φ = 1331016155436.
The previous prime is 1331016155411. The next prime is 1331016155449. The reversal of 1331016155437 is 7345516101331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 723093421801 + 607922733636 = 850349^2 + 779694^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331016155437 - 227 = 1330881937709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1331016155437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331016155407) 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, 665508077718 + 665508077719.
It is an arithmetic number, because the mean of its divisors is an integer number (665508077719).
Almost surely, 21331016155437 is an apocalyptic number.
It is an amenable number.
1331016155437 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331016155437 is an equidigital number, since it uses as much as digits as its factorization.
1331016155437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 40.
The spelling of 1331016155437 in words is "one trillion, three hundred thirty-one billion, sixteen million, one hundred fifty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •