Base | Representation |
---|---|
bin | 11011110100010110101101… |
… | …010011100110111011110011 |
3 | 121001012001221222000010001021 |
4 | 123310112231103212323303 |
5 | 112014000131030301024 |
6 | 1112112312430520311 |
7 | 34525065263050315 |
oct | 3364265523467363 |
9 | 531161858003037 |
10 | 122345051025139 |
11 | 35a8a276858278 |
12 | 1187b35a066097 |
13 | 5336120157967 |
14 | 222d763db37b5 |
15 | e2271ee5dde4 |
hex | 6f45ad4e6ef3 |
122345051025139 has 2 divisors, whose sum is σ = 122345051025140. Its totient is φ = 122345051025138.
The previous prime is 122345051025047. The next prime is 122345051025151. The reversal of 122345051025139 is 931520150543221.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122345051025139 is a prime.
It is a super-3 number, since 3×1223450510251393 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122345051025095 and 122345051025104.
It is not a weakly prime, because it can be changed into another prime (122345051025839) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61172525512569 + 61172525512570.
It is an arithmetic number, because the mean of its divisors is an integer number (61172525512570).
Almost surely, 2122345051025139 is an apocalyptic number.
122345051025139 is a deficient number, since it is larger than the sum of its proper divisors (1).
122345051025139 is an equidigital number, since it uses as much as digits as its factorization.
122345051025139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 122345051025139 in words is "one hundred twenty-two trillion, three hundred forty-five billion, fifty-one million, twenty-five thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •