Base | Representation |
---|---|
bin | 11101110111010100001000… |
… | …010011001010101010100011 |
3 | 122020001102012102011111101102 |
4 | 131313110020103022222203 |
5 | 114203422101213333443 |
6 | 1143202502422225015 |
7 | 36444220666156031 |
oct | 3567241023125243 |
9 | 566042172144342 |
10 | 131344534121123 |
11 | 389399a44037a4 |
12 | 1289354a88516b |
13 | 5839975bc438b |
14 | 2461176183551 |
15 | 102b88d083cb8 |
hex | 7775084caaa3 |
131344534121123 has 2 divisors, whose sum is σ = 131344534121124. Its totient is φ = 131344534121122.
The previous prime is 131344534121117. The next prime is 131344534121173. The reversal of 131344534121123 is 321121435443131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131344534121123 - 216 = 131344534055587 is a prime.
It is a super-2 number, since 2×1313445341211232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131344534121173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65672267060561 + 65672267060562.
It is an arithmetic number, because the mean of its divisors is an integer number (65672267060562).
Almost surely, 2131344534121123 is an apocalyptic number.
131344534121123 is a deficient number, since it is larger than the sum of its proper divisors (1).
131344534121123 is an equidigital number, since it uses as much as digits as its factorization.
131344534121123 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 38.
Adding to 131344534121123 its reverse (321121435443131), we get a palindrome (452465969564254).
The spelling of 131344534121123 in words is "one hundred thirty-one trillion, three hundred forty-four billion, five hundred thirty-four million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •