Base | Representation |
---|---|
bin | 111101001001111110… |
… | …1001100010110101111 |
3 | 110112222201000212000111 |
4 | 1322103331030112233 |
5 | 4122431303423043 |
6 | 140155513440451 |
7 | 12326340503413 |
oct | 1722375142657 |
9 | 415881025014 |
10 | 131331311023 |
11 | 50774112880 |
12 | 21552710127 |
13 | c4cc953433 |
14 | 64dc21ad43 |
15 | 3639b8b09d |
hex | 1e93f4c5af |
131331311023 has 16 divisors (see below), whose sum is σ = 149550849792. Its totient is φ = 114162048000.
The previous prime is 131331311009. The next prime is 131331311039. The reversal of 131331311023 is 320113133131.
It is not a de Polignac number, because 131331311023 - 229 = 130794440111 is a prime.
It is a super-2 number, since 2×1313313110232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131331310985 and 131331311003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131331311123) 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 in 15 ways as a sum of consecutive naturals, for example, 664303 + ... + 839023.
It is an arithmetic number, because the mean of its divisors is an integer number (9346928112).
Almost surely, 2131331311023 is an apocalyptic number.
131331311023 is a deficient number, since it is larger than the sum of its proper divisors (18219538769).
131331311023 is a wasteful number, since it uses less digits than its factorization.
131331311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177726.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 131331311023 its reverse (320113133131), we get a palindrome (451444444154).
The spelling of 131331311023 in words is "one hundred thirty-one billion, three hundred thirty-one million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •