Base | Representation |
---|---|
bin | 111101000000110100… |
… | …1011011101111110101 |
3 | 110112012022001000101010 |
4 | 1322001221123233311 |
5 | 4121314140010201 |
6 | 140105222022433 |
7 | 12315620553024 |
oct | 1720151335765 |
9 | 415168030333 |
10 | 131024141301 |
11 | 506267916a9 |
12 | 21487877a19 |
13 | c4811150c1 |
14 | 64ad4dc8bb |
15 | 361cc12bd6 |
hex | 1e81a5bbf5 |
131024141301 has 4 divisors (see below), whose sum is σ = 174698855072. Its totient is φ = 87349427532.
The previous prime is 131024141291. The next prime is 131024141309. The reversal of 131024141301 is 103141420131.
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.
It is not a de Polignac number, because 131024141301 - 225 = 130990586869 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 (131024141309) 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, 21837356881 + ... + 21837356886.
It is an arithmetic number, because the mean of its divisors is an integer number (43674713768).
Almost surely, 2131024141301 is an apocalyptic number.
It is an amenable number.
131024141301 is a deficient number, since it is larger than the sum of its proper divisors (43674713771).
131024141301 is an equidigital number, since it uses as much as digits as its factorization.
131024141301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43674713770.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 131024141301 its reverse (103141420131), we get a palindrome (234165561432).
It can be divided in two parts, 13102 and 4141301, that added together give a triangular number (4154403 = T2882).
The spelling of 131024141301 in words is "one hundred thirty-one billion, twenty-four million, one hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •