Base | Representation |
---|---|
bin | 111101001111111010… |
… | …1001100111000110110 |
3 | 110120111120220212102111 |
4 | 1322133311030320312 |
5 | 4123333304331041 |
6 | 140231352001234 |
7 | 12334310110546 |
oct | 1723765147066 |
9 | 416446825374 |
10 | 131530542646 |
11 | 50866620508 |
12 | 215a939021a |
13 | c531ccba79 |
14 | 651a87d326 |
15 | 364c3e2981 |
hex | 1e9fd4ce36 |
131530542646 has 4 divisors (see below), whose sum is σ = 197295813972. Its totient is φ = 65765271322.
The previous prime is 131530542593. The next prime is 131530542653. The reversal of 131530542646 is 646245035131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 646245035131 = 4447 ⋅145321573.
It is a junction number, because it is equal to n+sod(n) for n = 131530542599 and 131530542608.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32882635660 + ... + 32882635663.
It is an arithmetic number, because the mean of its divisors is an integer number (49323953493).
Almost surely, 2131530542646 is an apocalyptic number.
131530542646 is a deficient number, since it is larger than the sum of its proper divisors (65765271326).
131530542646 is an equidigital number, since it uses as much as digits as its factorization.
131530542646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65765271325.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 131530542646 its reverse (646245035131), we get a palindrome (777775577777).
The spelling of 131530542646 in words is "one hundred thirty-one billion, five hundred thirty million, five hundred forty-two thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •