Base | Representation |
---|---|
bin | 11101110010101000110001… |
… | …111111011000100100111110 |
3 | 122011220200112212220201212202 |
4 | 131302220301333120210332 |
5 | 114133140312410443402 |
6 | 1142355104122031502 |
7 | 36412051556035103 |
oct | 3562506177304476 |
9 | 564820485821782 |
10 | 131023111031102 |
11 | 38825653458924 |
12 | 128411a6948592 |
13 | 5815570916654 |
14 | 244d7a3b56aaa |
15 | 1023329c52b02 |
hex | 772a31fd893e |
131023111031102 has 4 divisors (see below), whose sum is σ = 196534666546656. Its totient is φ = 65511555515550.
The previous prime is 131023111031051. The next prime is 131023111031107. The reversal of 131023111031102 is 201130111320131.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1310231110311022 (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 (131023111031107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32755777757774 + ... + 32755777757777.
It is an arithmetic number, because the mean of its divisors is an integer number (49133666636664).
Almost surely, 2131023111031102 is an apocalyptic number.
131023111031102 is a deficient number, since it is larger than the sum of its proper divisors (65511555515554).
131023111031102 is an equidigital number, since it uses as much as digits as its factorization.
131023111031102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65511555515553.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 131023111031102 its reverse (201130111320131), we get a palindrome (332153222351233).
The spelling of 131023111031102 in words is "one hundred thirty-one trillion, twenty-three billion, one hundred eleven million, thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •