Base | Representation |
---|---|
bin | 111101000001110001… |
… | …1110010100001010111 |
3 | 110112021112101120210112 |
4 | 1322003203302201113 |
5 | 4121400342404101 |
6 | 140112325313235 |
7 | 12316460312510 |
oct | 1720343624127 |
9 | 415245346715 |
10 | 131056216151 |
11 | 506428a9a43 |
12 | 2149656581b |
13 | c4879655c3 |
14 | 64b388ba07 |
15 | 362094b6bb |
hex | 1e838f2857 |
131056216151 has 8 divisors (see below), whose sum is σ = 149782510080. Its totient is φ = 112330916568.
The previous prime is 131056216139. The next prime is 131056216219. The reversal of 131056216151 is 151612650131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131056216151 - 230 = 129982474327 is a prime.
It is a super-3 number, since 3×1310562161513 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131056216051) 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 7 ways as a sum of consecutive naturals, for example, 59270 + ... + 515388.
It is an arithmetic number, because the mean of its divisors is an integer number (18722813760).
Almost surely, 2131056216151 is an apocalyptic number.
131056216151 is a deficient number, since it is larger than the sum of its proper divisors (18726293929).
131056216151 is an equidigital number, since it uses as much as digits as its factorization.
131056216151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497173.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 131056216151 its reverse (151612650131), we get a palindrome (282668866282).
The spelling of 131056216151 in words is "one hundred thirty-one billion, fifty-six million, two hundred sixteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •