Base | Representation |
---|---|
bin | 11011100100011001100010… |
… | …001110001001011110010011 |
3 | 120220022020202122020122001012 |
4 | 123210121202032021132103 |
5 | 111343014040102021232 |
6 | 1105512454244401135 |
7 | 34352630465424365 |
oct | 3344314216113623 |
9 | 526266678218035 |
10 | 121248574642067 |
11 | 356a7260494894 |
12 | 117229523a61ab |
13 | 52868cb397822 |
14 | 21d2668894d35 |
15 | e03e489d29b2 |
hex | 6e4662389793 |
121248574642067 has 2 divisors, whose sum is σ = 121248574642068. Its totient is φ = 121248574642066.
The previous prime is 121248574642061. The next prime is 121248574642087. The reversal of 121248574642067 is 760246475842121.
It is a weak prime.
It is an emirp because it is prime and its reverse (760246475842121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121248574642067 - 28 = 121248574641811 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121248574641997 and 121248574642015.
It is not a weakly prime, because it can be changed into another prime (121248574642061) 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, 60624287321033 + 60624287321034.
It is an arithmetic number, because the mean of its divisors is an integer number (60624287321034).
Almost surely, 2121248574642067 is an apocalyptic number.
121248574642067 is a deficient number, since it is larger than the sum of its proper divisors (1).
121248574642067 is an equidigital number, since it uses as much as digits as its factorization.
121248574642067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36126720, while the sum is 59.
The spelling of 121248574642067 in words is "one hundred twenty-one trillion, two hundred forty-eight billion, five hundred seventy-four million, six hundred forty-two thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •