Base | Representation |
---|---|
bin | 11111000000111011011… |
… | …111111101010011100011 |
3 | 21112202021002202011110102 |
4 | 133000323133331103203 |
5 | 234404401303342011 |
6 | 4311035010453015 |
7 | 306660436123115 |
oct | 37007337752343 |
9 | 7482232664412 |
10 | 2131302012131 |
11 | 7519754719a6 |
12 | 2a508889416b |
13 | 125c9a0c9986 |
14 | 75226c413b5 |
15 | 3a6902cc73b |
hex | 1f03b7fd4e3 |
2131302012131 has 4 divisors (see below), whose sum is σ = 2163112489992. Its totient is φ = 2099491534272.
The previous prime is 2131302012097. The next prime is 2131302012167. The reversal of 2131302012131 is 1312102031312.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2131302012131 - 218 = 2131301749987 is a prime.
It is a super-3 number, since 3×21313020121313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2131302012031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15905238830 + ... + 15905238963.
It is an arithmetic number, because the mean of its divisors is an integer number (540778122498).
Almost surely, 22131302012131 is an apocalyptic number.
2131302012131 is a deficient number, since it is larger than the sum of its proper divisors (31810477861).
2131302012131 is an equidigital number, since it uses as much as digits as its factorization.
2131302012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31810477860.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2131302012131 its reverse (1312102031312), we get a palindrome (3443404043443).
The spelling of 2131302012131 in words is "two trillion, one hundred thirty-one billion, three hundred two million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •