Base | Representation |
---|---|
bin | 1011000010101111000001… |
… | …1011011100011111010001 |
3 | 1120222201121202201202100101 |
4 | 2300223300123130133101 |
5 | 3042412004443224123 |
6 | 41453440151452401 |
7 | 2362126306154536 |
oct | 260536033343721 |
9 | 46881552652311 |
10 | 12141611304913 |
11 | 39612570611a2 |
12 | 1441161087101 |
13 | 6a0c4504512c |
14 | 2dd92b204d8d |
15 | 160c70325aad |
hex | b0af06dc7d1 |
12141611304913 has 2 divisors, whose sum is σ = 12141611304914. Its totient is φ = 12141611304912.
The previous prime is 12141611304871. The next prime is 12141611304931. The reversal of 12141611304913 is 31940311614121.
Together with next prime (12141611304931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11412829810944 + 728781493969 = 3378288^2 + 853687^2 .
It is a cyclic number.
It is not a de Polignac number, because 12141611304913 - 213 = 12141611296721 is a prime.
It is not a weakly prime, because it can be changed into another prime (12141611304973) 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, 6070805652456 + 6070805652457.
It is an arithmetic number, because the mean of its divisors is an integer number (6070805652457).
Almost surely, 212141611304913 is an apocalyptic number.
It is an amenable number.
12141611304913 is a deficient number, since it is larger than the sum of its proper divisors (1).
12141611304913 is an equidigital number, since it uses as much as digits as its factorization.
12141611304913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 37.
The spelling of 12141611304913 in words is "twelve trillion, one hundred forty-one billion, six hundred eleven million, three hundred four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •