Base | Representation |
---|---|
bin | 111101001001101011… |
… | …0011100001000111111 |
3 | 110112221222220201112201 |
4 | 1322103112130020333 |
5 | 4122421203331223 |
6 | 140154512012331 |
7 | 12326155242433 |
oct | 1722326341077 |
9 | 415858821481 |
10 | 131321152063 |
11 | 50769404242 |
12 | 2154b2310a7 |
13 | c4ca80740a |
14 | 64dab349c3 |
15 | 3638d30ead |
hex | 1e9359c23f |
131321152063 has 4 divisors (see below), whose sum is σ = 132157592680. Its totient is φ = 130484711448.
The previous prime is 131321152037. The next prime is 131321152069. The reversal of 131321152063 is 360251123131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 360251123131 = 227 ⋅1587009353.
It is a cyclic number.
It is not a de Polignac number, because 131321152063 - 29 = 131321151551 is a prime.
It is a super-3 number, since 3×1313211520633 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131321152069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 418220073 + ... + 418220386.
It is an arithmetic number, because the mean of its divisors is an integer number (33039398170).
Almost surely, 2131321152063 is an apocalyptic number.
131321152063 is a deficient number, since it is larger than the sum of its proper divisors (836440617).
131321152063 is an equidigital number, since it uses as much as digits as its factorization.
131321152063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836440616.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 131321152063 its reverse (360251123131), we get a palindrome (491572275194).
The spelling of 131321152063 in words is "one hundred thirty-one billion, three hundred twenty-one million, one hundred fifty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •