Base | Representation |
---|---|
bin | 11101110010011100110001… |
… | …101000000000111011011010 |
3 | 122011212110021111011122210202 |
4 | 131302130301220000323122 |
5 | 114132432412310044114 |
6 | 1142345133022342202 |
7 | 36411114245100641 |
oct | 3562346150007332 |
9 | 564773244148722 |
10 | 131010220003034 |
11 | 38820138842719 |
12 | 1283a7a972a962 |
13 | 5814297caa0a8 |
14 | 244ccdda76358 |
15 | 1022d23178cde |
hex | 772731a00eda |
131010220003034 has 4 divisors (see below), whose sum is σ = 196515330004554. Its totient is φ = 65505110001516.
The previous prime is 131010220003007. The next prime is 131010220003037. The reversal of 131010220003034 is 430300022010131.
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., 91709294791009 + 39300925212025 = 9576497^2 + 6269045^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 131010220002997 and 131010220003015.
It is not an unprimeable number, because it can be changed into a prime (131010220003037) 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 as a sum of consecutive naturals, namely, 32752555000757 + ... + 32752555000760.
Almost surely, 2131010220003034 is an apocalyptic number.
131010220003034 is a deficient number, since it is larger than the sum of its proper divisors (65505110001520).
131010220003034 is an equidigital number, since it uses as much as digits as its factorization.
131010220003034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65505110001519.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 131010220003034 its reverse (430300022010131), we get a palindrome (561310242013165).
The spelling of 131010220003034 in words is "one hundred thirty-one trillion, ten billion, two hundred twenty million, three thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •