Base | Representation |
---|---|
bin | 11101111000010101001100… |
… | …101101000100110100110101 |
3 | 122020022002112120110220010202 |
4 | 131320111030231010310311 |
5 | 114211043143204142443 |
6 | 1143254535325130245 |
7 | 36452243240656166 |
oct | 3570251455046465 |
9 | 566262476426122 |
10 | 131414401240373 |
11 | 38966597596569 |
12 | 128a4ba90b9985 |
13 | 584342b954c64 |
14 | 24646c328976d |
15 | 102d5cbb977b8 |
hex | 77854cb44d35 |
131414401240373 has 2 divisors, whose sum is σ = 131414401240374. Its totient is φ = 131414401240372.
The previous prime is 131414401240361. The next prime is 131414401240411. The reversal of 131414401240373 is 373042104414131.
It is an a-pointer prime, because the next prime (131414401240411) can be obtained adding 131414401240373 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129704810995204 + 1709590245169 = 11388802^2 + 1307513^2 .
It is a cyclic number.
It is not a de Polignac number, because 131414401240373 - 28 = 131414401240117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131414401240303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65707200620186 + 65707200620187.
It is an arithmetic number, because the mean of its divisors is an integer number (65707200620187).
Almost surely, 2131414401240373 is an apocalyptic number.
It is an amenable number.
131414401240373 is a deficient number, since it is larger than the sum of its proper divisors (1).
131414401240373 is an equidigital number, since it uses as much as digits as its factorization.
131414401240373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96768, while the sum is 38.
The spelling of 131414401240373 in words is "one hundred thirty-one trillion, four hundred fourteen billion, four hundred one million, two hundred forty thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •