Base | Representation |
---|---|
bin | 111101001101001110… |
… | …1110101101001001111 |
3 | 110120021022112212002121 |
4 | 1322122131311221033 |
5 | 4123142234011142 |
6 | 140214414433411 |
7 | 12332135042146 |
oct | 1723235655117 |
9 | 416238485077 |
10 | 131440532047 |
11 | 5081a832190 |
12 | 21583202867 |
13 | c519475066 |
14 | 650c92c75d |
15 | 3644562c67 |
hex | 1e9a775a4f |
131440532047 has 4 divisors (see below), whose sum is σ = 143389671336. Its totient is φ = 119491392760.
The previous prime is 131440532011. The next prime is 131440532059. The reversal of 131440532047 is 740235044131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131440532047 - 215 = 131440499279 is a prime.
It is a super-2 number, since 2×1314405320472 (a number of 23 digits) contains 22 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 (131440532077) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 5974569628 + ... + 5974569649.
It is an arithmetic number, because the mean of its divisors is an integer number (35847417834).
Almost surely, 2131440532047 is an apocalyptic number.
131440532047 is a deficient number, since it is larger than the sum of its proper divisors (11949139289).
131440532047 is a wasteful number, since it uses less digits than its factorization.
131440532047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11949139288.
The product of its (nonzero) digits is 40320, while the sum is 34.
Adding to 131440532047 its reverse (740235044131), we get a palindrome (871675576178).
The spelling of 131440532047 in words is "one hundred thirty-one billion, four hundred forty million, five hundred thirty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •