Base | Representation |
---|---|
bin | 11101110010010011010001… |
… | …010011100111110110110011 |
3 | 122011211110221012222120201022 |
4 | 131302103101103213312303 |
5 | 114132301012103011011 |
6 | 1142340324202530055 |
7 | 36410303320326065 |
oct | 3562232123476663 |
9 | 564743835876638 |
10 | 131000014110131 |
11 | 38816880890291 |
12 | 1283881b80692b |
13 | 581332c7512ca |
14 | 244c612439735 |
15 | 102292719a8db |
hex | 7724d14e7db3 |
131000014110131 has 8 divisors (see below), whose sum is σ = 136780099096320. Its totient is φ = 125226965140552.
The previous prime is 131000014110113. The next prime is 131000014110139. The reversal of 131000014110131 is 131011410000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131000014110131 - 238 = 130725136203187 is a prime.
It is a super-2 number, since 2×1310000141101312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131000014110139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1758966095 + ... + 1759040568.
It is an arithmetic number, because the mean of its divisors is an integer number (17097512387040).
Almost surely, 2131000014110131 is an apocalyptic number.
131000014110131 is a deficient number, since it is larger than the sum of its proper divisors (5780084986189).
131000014110131 is a wasteful number, since it uses less digits than its factorization.
131000014110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3518008305.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 131000014110131 its reverse (131011410000131), we get a palindrome (262011424110262).
The spelling of 131000014110131 in words is "one hundred thirty-one trillion, fourteen million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •