Base | Representation |
---|---|
bin | 1100111000010001110110… |
… | …1011111000000110000011 |
3 | 1212010210000210122101001112 |
4 | 3032010131223320012003 |
5 | 3324003214313404011 |
6 | 50041250451353535 |
7 | 2661045624201044 |
oct | 316043553700603 |
9 | 55123023571045 |
10 | 14161005216131 |
11 | 456a7152a4584 |
12 | 17085b7bb28ab |
13 | 7b94b9535cc7 |
14 | 36d57968a8cb |
15 | 198560c4c58b |
hex | ce11daf8183 |
14161005216131 has 2 divisors, whose sum is σ = 14161005216132. Its totient is φ = 14161005216130.
The previous prime is 14161005216077. The next prime is 14161005216199. The reversal of 14161005216131 is 13161250016141.
It is a weak prime.
It is an emirp because it is prime and its reverse (13161250016141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14161005216131 is a prime.
It is a super-2 number, since 2×141610052161312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14161005216731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7080502608065 + 7080502608066.
It is an arithmetic number, because the mean of its divisors is an integer number (7080502608066).
Almost surely, 214161005216131 is an apocalyptic number.
14161005216131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14161005216131 is an equidigital number, since it uses as much as digits as its factorization.
14161005216131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 14161005216131 in words is "fourteen trillion, one hundred sixty-one billion, five million, two hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •