Base | Representation |
---|---|
bin | 11101110010110100001001… |
… | …101101011101000001111111 |
3 | 122011221212001202111221012022 |
4 | 131302310021231131001333 |
5 | 114133340313424101444 |
6 | 1142404443421430355 |
7 | 36412663246552325 |
oct | 3562641155350177 |
9 | 564855052457168 |
10 | 131035320143999 |
11 | 3882a849157077 |
12 | 1284363370b3bb |
13 | 58167681a62cb |
14 | 2450201449d15 |
15 | 10237e1a2c9ee |
hex | 772d09b5d07f |
131035320143999 has 16 divisors (see below), whose sum is σ = 135245241077760. Its totient is φ = 126861411186720.
The previous prime is 131035320143977. The next prime is 131035320144017. The reversal of 131035320143999 is 999341023530131.
It is a cyclic number.
It is not a de Polignac number, because 131035320143999 - 244 = 113443134099583 is a prime.
It is a super-2 number, since 2×1310353201439992 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131035320143999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131035380143999) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5570834 + ... + 17120304.
It is an arithmetic number, because the mean of its divisors is an integer number (8452827567360).
Almost surely, 2131035320143999 is an apocalyptic number.
131035320143999 is a deficient number, since it is larger than the sum of its proper divisors (4209920933761).
131035320143999 is a wasteful number, since it uses less digits than its factorization.
131035320143999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11551030.
The product of its (nonzero) digits is 2361960, while the sum is 53.
The spelling of 131035320143999 in words is "one hundred thirty-one trillion, thirty-five billion, three hundred twenty million, one hundred forty-three thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •