Base | Representation |
---|---|
bin | 111101000110011100… |
… | …1111111011011001001 |
3 | 110112200110110121111002 |
4 | 1322030321333123021 |
5 | 4122211013443423 |
6 | 140140050344345 |
7 | 12323403235133 |
oct | 1721471773311 |
9 | 415613417432 |
10 | 131213031113 |
11 | 5071337638a |
12 | 2151ab8b0b5 |
13 | c4b12ac418 |
14 | 64ca62c053 |
15 | 362e5c5228 |
hex | 1e8ce7f6c9 |
131213031113 has 8 divisors (see below), whose sum is σ = 135776885760. Its totient is φ = 126669875040.
The previous prime is 131213031073. The next prime is 131213031139. The reversal of 131213031113 is 311130312131.
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 131213031113 - 216 = 131212965577 is a prime.
It is a super-2 number, since 2×1312130311132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131213031413) 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 7 ways as a sum of consecutive naturals, for example, 5161745 + ... + 5187102.
It is an arithmetic number, because the mean of its divisors is an integer number (16972110720).
Almost surely, 2131213031113 is an apocalyptic number.
It is an amenable number.
131213031113 is a deficient number, since it is larger than the sum of its proper divisors (4563854647).
131213031113 is a wasteful number, since it uses less digits than its factorization.
131213031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10349287.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 131213031113 its reverse (311130312131), we get a palindrome (442343343244).
The spelling of 131213031113 in words is "one hundred thirty-one billion, two hundred thirteen million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •