Base | Representation |
---|---|
bin | 11101111000011101101100… |
… | …010110000011110010111001 |
3 | 122020022222002012211010011002 |
4 | 131320131230112003302321 |
5 | 114211220333113343340 |
6 | 1143303044343014345 |
7 | 36453015251155133 |
oct | 3570355426036271 |
9 | 566288065733132 |
10 | 131423522012345 |
11 | 3896a447a76542 |
12 | 128a691373a3b5 |
13 | 584425343c654 |
14 | 2464d0a73c053 |
15 | 102d96277d715 |
hex | 77876c583cb9 |
131423522012345 has 8 divisors (see below), whose sum is σ = 158265499301376. Its totient is φ = 104767302352176.
The previous prime is 131423522012323. The next prime is 131423522012351. The reversal of 131423522012345 is 543210225324131.
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 131423522012345 - 244 = 113831335967929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131423522012299 and 131423522012308.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46439405657 + ... + 46439408486.
It is an arithmetic number, because the mean of its divisors is an integer number (19783187412672).
Almost surely, 2131423522012345 is an apocalyptic number.
It is an amenable number.
131423522012345 is a deficient number, since it is larger than the sum of its proper divisors (26841977289031).
131423522012345 is an equidigital number, since it uses as much as digits as its factorization.
131423522012345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92878814431.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 131423522012345 its reverse (543210225324131), we get a palindrome (674633747336476).
The spelling of 131423522012345 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, five hundred twenty-two million, twelve thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •