Base | Representation |
---|---|
bin | 11101110100011111111110… |
… | …111111110001010000011110 |
3 | 122012100220220222020022012022 |
4 | 131310133332333301100132 |
5 | 114142234430223404204 |
6 | 1142533552522340142 |
7 | 36424232426502443 |
oct | 3564377677612036 |
9 | 565326828208168 |
10 | 131151104513054 |
11 | 3887496443927a |
12 | 12861b6765a652 |
13 | 582465aba10a2 |
14 | 2455a6694b9ca |
15 | 102681b8675be |
hex | 7747feff141e |
131151104513054 has 4 divisors (see below), whose sum is σ = 196726656769584. Its totient is φ = 65575552256526.
The previous prime is 131151104512943. The next prime is 131151104513059. The reversal of 131151104513054 is 450315401151131.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1311511045130542 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131151104513059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32787776128262 + ... + 32787776128265.
It is an arithmetic number, because the mean of its divisors is an integer number (49181664192396).
Almost surely, 2131151104513054 is an apocalyptic number.
131151104513054 is a deficient number, since it is larger than the sum of its proper divisors (65575552256530).
131151104513054 is an equidigital number, since it uses as much as digits as its factorization.
131151104513054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65575552256529.
The product of its (nonzero) digits is 18000, while the sum is 35.
Adding to 131151104513054 its reverse (450315401151131), we get a palindrome (581466505664185).
The spelling of 131151104513054 in words is "one hundred thirty-one trillion, one hundred fifty-one billion, one hundred four million, five hundred thirteen thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •