Base | Representation |
---|---|
bin | 10011011000000000010… |
… | …001000000100010100111 |
3 | 11201021200122101102202021 |
4 | 103120000101000202213 |
5 | 133303244221223143 |
6 | 2455353532324011 |
7 | 165123300664060 |
oct | 23300021004247 |
9 | 4637618342667 |
10 | 1331444320423 |
11 | 473731676568 |
12 | 196062013607 |
13 | 987297881b9 |
14 | 48629761567 |
15 | 2497974aced |
hex | 136004408a7 |
1331444320423 has 8 divisors (see below), whose sum is σ = 1529297139200. Its totient is φ = 1135503123480.
The previous prime is 1331444320417. The next prime is 1331444320463. The reversal of 1331444320423 is 3240234441331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1331444320423 - 221 = 1331442223271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331444320463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477903963 + ... + 477906748.
It is an arithmetic number, because the mean of its divisors is an integer number (191162142400).
Almost surely, 21331444320423 is an apocalyptic number.
1331444320423 is a deficient number, since it is larger than the sum of its proper divisors (197852818777).
1331444320423 is an equidigital number, since it uses as much as digits as its factorization.
1331444320423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 955810917.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 1331444320423 its reverse (3240234441331), we get a palindrome (4571678761754).
The spelling of 1331444320423 in words is "one trillion, three hundred thirty-one billion, four hundred forty-four million, three hundred twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •