Base | Representation |
---|---|
bin | 11101111000011101010100… |
… | …011000101010000111011101 |
3 | 122020022221001012102211022202 |
4 | 131320131110120222013131 |
5 | 114211214022212243123 |
6 | 1143302540423221245 |
7 | 36453002300361245 |
oct | 3570352430520735 |
9 | 566287035384282 |
10 | 131423120040413 |
11 | 3896a261084033 |
12 | 128a6820ba7825 |
13 | 58441bb08a636 |
14 | 2464cad1c2b25 |
15 | 102d93c32aa28 |
hex | 77875462a1dd |
131423120040413 has 16 divisors (see below), whose sum is σ = 133092066556800. Its totient is φ = 129758560081920.
The previous prime is 131423120040409. The next prime is 131423120040419. The reversal of 131423120040413 is 314040021324131.
It is a cyclic number.
It is not a de Polignac number, because 131423120040413 - 22 = 131423120040409 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 (131423120040419) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 204310973 + ... + 204953213.
It is an arithmetic number, because the mean of its divisors is an integer number (8318254159800).
Almost surely, 2131423120040413 is an apocalyptic number.
It is an amenable number.
131423120040413 is a deficient number, since it is larger than the sum of its proper divisors (1668946516387).
131423120040413 is an equidigital number, since it uses as much as digits as its factorization.
131423120040413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645652.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 131423120040413 its reverse (314040021324131), we get a palindrome (445463141364544).
The spelling of 131423120040413 in words is "one hundred thirty-one trillion, four hundred twenty-three billion, one hundred twenty million, forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •