Base | Representation |
---|---|
bin | 10100101001001110001… |
… | …110111000000011010011 |
3 | 12000121210021111212011112 |
4 | 110221032032320003103 |
5 | 141220344320331011 |
6 | 3003415234003535 |
7 | 204331340513006 |
oct | 24511616700323 |
9 | 5017707455145 |
10 | 1418651730131 |
11 | 4a7712a10199 |
12 | 1aab3b7165ab |
13 | a3a16b75a8c |
14 | 4c93d80753d |
15 | 26d8085358b |
hex | 14a4e3b80d3 |
1418651730131 has 2 divisors, whose sum is σ = 1418651730132. Its totient is φ = 1418651730130.
The previous prime is 1418651730103. The next prime is 1418651730163. The reversal of 1418651730131 is 1310371568141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1418651730131 - 234 = 1401471860947 is a prime.
It is a super-2 number, since 2×14186517301312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1418651730731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 709325865065 + 709325865066.
It is an arithmetic number, because the mean of its divisors is an integer number (709325865066).
Almost surely, 21418651730131 is an apocalyptic number.
1418651730131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1418651730131 is an equidigital number, since it uses as much as digits as its factorization.
1418651730131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 41.
The spelling of 1418651730131 in words is "one trillion, four hundred eighteen billion, six hundred fifty-one million, seven hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •