Base | Representation |
---|---|
bin | 111101001111111011… |
… | …1000000100100111111 |
3 | 110120111121210221110001 |
4 | 1322133313000210333 |
5 | 4123333420012021 |
6 | 140231410055131 |
7 | 12334314123226 |
oct | 1723767004477 |
9 | 416447727401 |
10 | 131531016511 |
11 | 50866914534 |
12 | 215a957a4a7 |
13 | c53213666b |
14 | 651a963cbd |
15 | 364c488091 |
hex | 1e9fdc093f |
131531016511 has 4 divisors (see below), whose sum is σ = 131621917072. Its totient is φ = 131440115952.
The previous prime is 131531016509. The next prime is 131531016521. The reversal of 131531016511 is 115610135131.
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 131531016511 - 21 = 131531016509 is a prime.
It is a super-2 number, since 2×1315310165112 (a number of 23 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 131531016511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131531016521) 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 3 ways as a sum of consecutive naturals, for example, 45448110 + ... + 45451003.
It is an arithmetic number, because the mean of its divisors is an integer number (32905479268).
Almost surely, 2131531016511 is an apocalyptic number.
131531016511 is a deficient number, since it is larger than the sum of its proper divisors (90900561).
131531016511 is an equidigital number, since it uses as much as digits as its factorization.
131531016511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90900560.
The product of its (nonzero) digits is 1350, while the sum is 28.
The spelling of 131531016511 in words is "one hundred thirty-one billion, five hundred thirty-one million, sixteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •