Base | Representation |
---|---|
bin | 111101001101010000… |
… | …0100011110010100111 |
3 | 110120021100220002120021 |
4 | 1322122200203302213 |
5 | 4123142424322401 |
6 | 140214442020011 |
7 | 12332144102563 |
oct | 1723240436247 |
9 | 416240802507 |
10 | 131441245351 |
11 | 5082017a099 |
12 | 215834a7607 |
13 | c519664930 |
14 | 650ca766a3 |
15 | 36446542a1 |
hex | 1e9a823ca7 |
131441245351 has 4 divisors (see below), whose sum is σ = 141552110392. Its totient is φ = 121330380312.
The previous prime is 131441245349. The next prime is 131441245357. The reversal of 131441245351 is 153542144131.
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 131441245351 - 21 = 131441245349 is a prime.
It is a super-2 number, since 2×1314412453512 (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 (131441245357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5055432501 + ... + 5055432526.
It is an arithmetic number, because the mean of its divisors is an integer number (35388027598).
Almost surely, 2131441245351 is an apocalyptic number.
131441245351 is a deficient number, since it is larger than the sum of its proper divisors (10110865041).
131441245351 is a wasteful number, since it uses less digits than its factorization.
131441245351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10110865040.
The product of its digits is 28800, while the sum is 34.
Adding to 131441245351 its reverse (153542144131), we get a palindrome (284983389482).
The spelling of 131441245351 in words is "one hundred thirty-one billion, four hundred forty-one million, two hundred forty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •