Base | Representation |
---|---|
bin | 11110100010110001110010… |
… | …110011000010110111110111 |
3 | 122121121221121212122001200002 |
4 | 132202301302303002313313 |
5 | 120101341022210232211 |
6 | 1153410542524341515 |
7 | 40203055261656044 |
oct | 3642616263026767 |
9 | 577557555561602 |
10 | 134331323133431 |
11 | 39890659997926 |
12 | 130963883a489b |
13 | 59c550a71bca8 |
14 | 25259566ac1cb |
15 | 107e3eca9b03b |
hex | 7a2c72cc2df7 |
134331323133431 has 12 divisors (see below), whose sum is σ = 138889621334520. Its totient is φ = 129908256130800.
The previous prime is 134331323133409. The next prime is 134331323133443.
134331323133431 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 134331323133431 - 210 = 134331323132407 is a prime.
It is a super-4 number, since 4×1343313231334314 (a number of 58 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134331323138431) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 359470661 + ... + 359844158.
It is an arithmetic number, because the mean of its divisors is an integer number (11574135111210).
Almost surely, 2134331323133431 is an apocalyptic number.
134331323133431 is a deficient number, since it is larger than the sum of its proper divisors (4558298201089).
134331323133431 is an equidigital number, since it uses as much as digits as its factorization.
134331323133431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 719315006 (or 719314963 counting only the distinct ones).
The product of its digits is 209952, while the sum is 38.
The spelling of 134331323133431 in words is "one hundred thirty-four trillion, three hundred thirty-one billion, three hundred twenty-three million, one hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •