Base | Representation |
---|---|
bin | 111101000001000010… |
… | …1000111111111011101 |
3 | 110112012210200211000010 |
4 | 1322002011013333131 |
5 | 4121323014303123 |
6 | 140110041353433 |
7 | 12316036345434 |
oct | 1720205077735 |
9 | 415183624003 |
10 | 131031400413 |
11 | 5062a89a571 |
12 | 2148a198879 |
13 | c482787234 |
14 | 64b046c11b |
15 | 361d698993 |
hex | 1e82147fdd |
131031400413 has 4 divisors (see below), whose sum is σ = 174708533888. Its totient is φ = 87354266940.
The previous prime is 131031400391. The next prime is 131031400417. The reversal of 131031400413 is 314004130131.
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 131031400413 - 234 = 113851531229 is a prime.
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 131031400413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131031400417) 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, 21838566733 + ... + 21838566738.
It is an arithmetic number, because the mean of its divisors is an integer number (43677133472).
Almost surely, 2131031400413 is an apocalyptic number.
It is an amenable number.
131031400413 is a deficient number, since it is larger than the sum of its proper divisors (43677133475).
131031400413 is an equidigital number, since it uses as much as digits as its factorization.
131031400413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43677133474.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131031400413 its reverse (314004130131), we get a palindrome (445035530544).
The spelling of 131031400413 in words is "one hundred thirty-one billion, thirty-one million, four hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •