Base | Representation |
---|---|
bin | 11011111000010001000011… |
… | …001100100011110001011011 |
3 | 121002010202210021201102220101 |
4 | 123320101003030203301123 |
5 | 112032401133023410211 |
6 | 1112440005441440231 |
7 | 34553362412261242 |
oct | 3370210314436133 |
9 | 532122707642811 |
10 | 122613853731931 |
11 | 36083274993421 |
12 | 11903477640077 |
13 | 535558a837053 |
14 | 223c783a83959 |
15 | e297038405c1 |
hex | 6f8443323c5b |
122613853731931 has 2 divisors, whose sum is σ = 122613853731932. Its totient is φ = 122613853731930.
The previous prime is 122613853731923. The next prime is 122613853731953. The reversal of 122613853731931 is 139137358316221.
It is a weak prime.
It is an emirp because it is prime and its reverse (139137358316221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122613853731931 - 23 = 122613853731923 is a prime.
It is a super-2 number, since 2×1226138537319312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122613853731911) 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, 61306926865965 + 61306926865966.
It is an arithmetic number, because the mean of its divisors is an integer number (61306926865966).
Almost surely, 2122613853731931 is an apocalyptic number.
122613853731931 is a deficient number, since it is larger than the sum of its proper divisors (1).
122613853731931 is an equidigital number, since it uses as much as digits as its factorization.
122613853731931 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4898880, while the sum is 55.
The spelling of 122613853731931 in words is "one hundred twenty-two trillion, six hundred thirteen billion, eight hundred fifty-three million, seven hundred thirty-one thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •