Base | Representation |
---|---|
bin | 11101110010011100111000… |
… | …011100001011110010110001 |
3 | 122011212110120110022200211011 |
4 | 131302130320130023302301 |
5 | 114132433131042423241 |
6 | 1142345152225150521 |
7 | 36411120134004430 |
oct | 3562347034136261 |
9 | 564773513280734 |
10 | 131010334342321 |
11 | 388201973384a5 |
12 | 1283a81ba8b441 |
13 | 58142b58a1585 |
14 | 244cd10d1b117 |
15 | 1022d2d212281 |
hex | 77273870bcb1 |
131010334342321 has 16 divisors (see below), whose sum is σ = 157607849318400. Its totient is φ = 106383365003088.
The previous prime is 131010334342141. The next prime is 131010334342351. The reversal of 131010334342321 is 123243433010131.
It is a cyclic number.
It is not a de Polignac number, because 131010334342321 - 211 = 131010334340273 is a prime.
It is a super-2 number, since 2×1310103343423212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131010334342351) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10402440 + ... + 19241398.
It is an arithmetic number, because the mean of its divisors is an integer number (9850490582400).
Almost surely, 2131010334342321 is an apocalyptic number.
It is an amenable number.
131010334342321 is a deficient number, since it is larger than the sum of its proper divisors (26597514976079).
131010334342321 is a wasteful number, since it uses less digits than its factorization.
131010334342321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8950428.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 131010334342321 its reverse (123243433010131), we get a palindrome (254253767352452).
The spelling of 131010334342321 in words is "one hundred thirty-one trillion, ten billion, three hundred thirty-four million, three hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •