Base | Representation |
---|---|
bin | 111110010110011001101101… |
… | …111000010001110101001101 |
3 | 1022221221000102120210112101012 |
4 | 332112121231320101311031 |
5 | 241420243112303400221 |
6 | 2411114054251055005 |
7 | 111521422510561046 |
oct | 7626315570216515 |
9 | 1287830376715335 |
10 | 274218325450061 |
11 | 7a41337a950093 |
12 | 26909422441465 |
13 | ba018a587c845 |
14 | 4ba03486138cd |
15 | 21a80abc0765b |
hex | f9666de11d4d |
274218325450061 has 2 divisors, whose sum is σ = 274218325450062. Its totient is φ = 274218325450060.
The previous prime is 274218325450037. The next prime is 274218325450067. The reversal of 274218325450061 is 160054523812472.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 268593748768900 + 5624576681161 = 16388830^2 + 2371619^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-274218325450061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 274218325449991 and 274218325450009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (274218325450067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 137109162725030 + 137109162725031.
It is an arithmetic number, because the mean of its divisors is an integer number (137109162725031).
Almost surely, 2274218325450061 is an apocalyptic number.
It is an amenable number.
274218325450061 is a deficient number, since it is larger than the sum of its proper divisors (1).
274218325450061 is an equidigital number, since it uses as much as digits as its factorization.
274218325450061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3225600, while the sum is 50.
The spelling of 274218325450061 in words is "two hundred seventy-four trillion, two hundred eighteen billion, three hundred twenty-five million, four hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •