Base | Representation |
---|---|
bin | 111101001001001000… |
… | …1010001101100010011 |
3 | 110112220201210120212010 |
4 | 1322102101101230103 |
5 | 4122402033140311 |
6 | 140153023234003 |
7 | 12325545160236 |
oct | 1722221215423 |
9 | 415821716763 |
10 | 131303021331 |
11 | 5075a150369 |
12 | 21545148903 |
13 | c4c6b29a81 |
14 | 64d857541d |
15 | 363744dda6 |
hex | 1e92451b13 |
131303021331 has 16 divisors (see below), whose sum is σ = 175881356960. Its totient is φ = 87130218240.
The previous prime is 131303021293. The next prime is 131303021351. The reversal of 131303021331 is 133120303131.
It is not a de Polignac number, because 131303021331 - 210 = 131303020307 is a prime.
It is a super-2 number, since 2×1313030213312 (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 = 131303021298 and 131303021307.
It is not an unprimeable number, because it can be changed into a prime (131303021351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2830101 + ... + 2876121.
It is an arithmetic number, because the mean of its divisors is an integer number (10992584810).
Almost surely, 2131303021331 is an apocalyptic number.
131303021331 is a deficient number, since it is larger than the sum of its proper divisors (44578335629).
131303021331 is a wasteful number, since it uses less digits than its factorization.
131303021331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50406.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 131303021331 its reverse (133120303131), we get a palindrome (264423324462).
The spelling of 131303021331 in words is "one hundred thirty-one billion, three hundred three million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •