Base | Representation |
---|---|
bin | 11101110010011101100110… |
… | …111000000011011110101010 |
3 | 122011212112120202020221100221 |
4 | 131302131212320003132222 |
5 | 114132441230012301414 |
6 | 1142345401415120254 |
7 | 36411145343616334 |
oct | 3562354670033652 |
9 | 564775522227327 |
10 | 131011113400234 |
11 | 38820557075211 |
12 | 1283a9b897308a |
13 | 58143ab1012a2 |
14 | 244cd86594454 |
15 | 1022d767ee224 |
hex | 772766e037aa |
131011113400234 has 4 divisors (see below), whose sum is σ = 196516670100354. Its totient is φ = 65505556700116.
The previous prime is 131011113400231. The next prime is 131011113400247. The reversal of 131011113400234 is 432004311110131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 128999552693209 + 2011560707025 = 11357797^2 + 1418295^2 .
It is a super-2 number, since 2×1310111134002342 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131011113400199 and 131011113400208.
It is not an unprimeable number, because it can be changed into a prime (131011113400231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32752778350057 + ... + 32752778350060.
Almost surely, 2131011113400234 is an apocalyptic number.
131011113400234 is a deficient number, since it is larger than the sum of its proper divisors (65505556700120).
131011113400234 is an equidigital number, since it uses as much as digits as its factorization.
131011113400234 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65505556700119.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 131011113400234 its reverse (432004311110131), we get a palindrome (563015424510365).
The spelling of 131011113400234 in words is "one hundred thirty-one trillion, eleven billion, one hundred thirteen million, four hundred thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •