Base | Representation |
---|---|
bin | 11101111000010100000000… |
… | …100001011010010101100111 |
3 | 122020021222020111110100211122 |
4 | 131320110000201122111213 |
5 | 114211033034004124333 |
6 | 1143254204430324155 |
7 | 36452166461041220 |
oct | 3570240041322547 |
9 | 566258214410748 |
10 | 131413123114343 |
11 | 38965aa1079564 |
12 | 128a48b105965b |
13 | 5843286c08375 |
14 | 2464601620247 |
15 | 102d554878798 |
hex | 77850085a567 |
131413123114343 has 8 divisors (see below), whose sum is σ = 152428014870912. Its totient is φ = 110958628471416.
The previous prime is 131413123114333. The next prime is 131413123114369. The reversal of 131413123114343 is 343411321314131.
It is a happy number.
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 131413123114343 - 218 = 131413122852199 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 (131413123114333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140099277905 + ... + 140099278842.
It is an arithmetic number, because the mean of its divisors is an integer number (19053501858864).
Almost surely, 2131413123114343 is an apocalyptic number.
131413123114343 is a deficient number, since it is larger than the sum of its proper divisors (21014891756569).
131413123114343 is an equidigital number, since it uses as much as digits as its factorization.
131413123114343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280198556821.
The product of its digits is 31104, while the sum is 35.
Adding to 131413123114343 its reverse (343411321314131), we get a palindrome (474824444428474).
The spelling of 131413123114343 in words is "one hundred thirty-one trillion, four hundred thirteen billion, one hundred twenty-three million, one hundred fourteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •