Base | Representation |
---|---|
bin | 11011101111100000111010… |
… | …100011110001111110101011 |
3 | 121000000021100212122002122002 |
4 | 123233200322203301332223 |
5 | 111443022410312344201 |
6 | 1111255421240121215 |
7 | 34462051226652533 |
oct | 3357407243617653 |
9 | 530007325562562 |
10 | 122012413403051 |
11 | 359711a0566486 |
12 | 118269a646620b |
13 | 531094b67a942 |
14 | 221b60a3d04c3 |
15 | e18c5231376b |
hex | 6ef83a8f1fab |
122012413403051 has 2 divisors, whose sum is σ = 122012413403052. Its totient is φ = 122012413403050.
The previous prime is 122012413403033. The next prime is 122012413403113. The reversal of 122012413403051 is 150304314210221.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122012413403051 is a prime.
It is a super-2 number, since 2×1220124134030512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122012413403651) 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, 61006206701525 + 61006206701526.
It is an arithmetic number, because the mean of its divisors is an integer number (61006206701526).
Almost surely, 2122012413403051 is an apocalyptic number.
122012413403051 is a deficient number, since it is larger than the sum of its proper divisors (1).
122012413403051 is an equidigital number, since it uses as much as digits as its factorization.
122012413403051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 122012413403051 its reverse (150304314210221), we get a palindrome (272316727613272).
The spelling of 122012413403051 in words is "one hundred twenty-two trillion, twelve billion, four hundred thirteen million, four hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •