Base | Representation |
---|---|
bin | 11101110100010110111000… |
… | …000011010011110111001101 |
3 | 122012022222200101002020102020 |
4 | 131310112320003103313031 |
5 | 114142104413011334201 |
6 | 1142525254231120353 |
7 | 36423435161326554 |
oct | 3564267003236715 |
9 | 565288611066366 |
10 | 131141324324301 |
11 | 388707a5808755 |
12 | 128600982130b9 |
13 | 582375c8b6455 |
14 | 24553b9a86d9b |
15 | 1026447e28a36 |
hex | 7745b80d3dcd |
131141324324301 has 32 divisors (see below), whose sum is σ = 180896263158528. Its totient is φ = 84441613201920.
The previous prime is 131141324324249. The next prime is 131141324324323. The reversal of 131141324324301 is 103423423141131.
It is a happy number.
It is not a de Polignac number, because 131141324324301 - 27 = 131141324324173 is a prime.
It is a super-2 number, since 2×1311413243243012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131141324324371) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 800277691 + ... + 800441543.
It is an arithmetic number, because the mean of its divisors is an integer number (5653008223704).
Almost surely, 2131141324324301 is an apocalyptic number.
It is an amenable number.
131141324324301 is a deficient number, since it is larger than the sum of its proper divisors (49754938834227).
131141324324301 is a wasteful number, since it uses less digits than its factorization.
131141324324301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216661.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 131141324324301 its reverse (103423423141131), we get a palindrome (234564747465432).
The spelling of 131141324324301 in words is "one hundred thirty-one trillion, one hundred forty-one billion, three hundred twenty-four million, three hundred twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •