Base | Representation |
---|---|
bin | 111101001001000101… |
… | …1100010010010101101 |
3 | 110112220121222010120012 |
4 | 1322102023202102231 |
5 | 4122401142011321 |
6 | 140152531103005 |
7 | 12325526321663 |
oct | 1722213422255 |
9 | 415817863505 |
10 | 131301516461 |
11 | 50759312775 |
12 | 21544741a65 |
13 | c4c6720b0b |
14 | 64d82a2c33 |
15 | 363725305b |
hex | 1e922e24ad |
131301516461 has 4 divisors (see below), whose sum is σ = 131320423872. Its totient is φ = 131282609052.
The previous prime is 131301516427. The next prime is 131301516481. The reversal of 131301516461 is 164615103131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 164615103131 = 23 ⋅7157178397.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131301516461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131301516481) 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, 9443285 + ... + 9457178.
It is an arithmetic number, because the mean of its divisors is an integer number (32830105968).
Almost surely, 2131301516461 is an apocalyptic number.
It is an amenable number.
131301516461 is a deficient number, since it is larger than the sum of its proper divisors (18907411).
131301516461 is an equidigital number, since it uses as much as digits as its factorization.
131301516461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18907410.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 131301516461 its reverse (164615103131), we get a palindrome (295916619592).
The spelling of 131301516461 in words is "one hundred thirty-one billion, three hundred one million, five hundred sixteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •