Base | Representation |
---|---|
bin | 111101000011000111… |
… | …1000011010001111111 |
3 | 110112101122212111112101 |
4 | 1322012033003101333 |
5 | 4121443341031143 |
6 | 140121011445531 |
7 | 12320544026512 |
oct | 1720617032177 |
9 | 415348774471 |
10 | 131101111423 |
11 | 50666183477 |
12 | 214a95b68a7 |
13 | c494054359 |
14 | 64b9816d79 |
15 | 3624868b4d |
hex | 1e863c347f |
131101111423 has 2 divisors, whose sum is σ = 131101111424. Its totient is φ = 131101111422.
The previous prime is 131101111387. The next prime is 131101111499. The reversal of 131101111423 is 324111101131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131101111423 is a prime.
It is a super-2 number, since 2×1311011114232 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131101111423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131101171423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65550555711 + 65550555712.
It is an arithmetic number, because the mean of its divisors is an integer number (65550555712).
Almost surely, 2131101111423 is an apocalyptic number.
131101111423 is a deficient number, since it is larger than the sum of its proper divisors (1).
131101111423 is an equidigital number, since it uses as much as digits as its factorization.
131101111423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 131101111423 its reverse (324111101131), we get a palindrome (455212212554).
The spelling of 131101111423 in words is "one hundred thirty-one billion, one hundred one million, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •