Base | Representation |
---|---|
bin | 10001101001110011110… |
… | …110011010001101101101 |
3 | 11021222021201121202020011 |
4 | 101221303312122031231 |
5 | 124333434322423321 |
6 | 2325145054253221 |
7 | 153434232302362 |
oct | 21516366321555 |
9 | 4258251552204 |
10 | 1213124420461 |
11 | 428535122478 |
12 | 177140ab7211 |
13 | 8a5216a0685 |
14 | 42a03600469 |
15 | 21852017ae1 |
hex | 11a73d9a36d |
1213124420461 has 2 divisors, whose sum is σ = 1213124420462. Its totient is φ = 1213124420460.
The previous prime is 1213124420393. The next prime is 1213124420467. The reversal of 1213124420461 is 1640244213121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1182243036100 + 30881384361 = 1087310^2 + 175731^2 .
It is a cyclic number.
It is not a de Polignac number, because 1213124420461 - 229 = 1212587549549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213124420467) 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, 606562210230 + 606562210231.
It is an arithmetic number, because the mean of its divisors is an integer number (606562210231).
Almost surely, 21213124420461 is an apocalyptic number.
It is an amenable number.
1213124420461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213124420461 is an equidigital number, since it uses as much as digits as its factorization.
1213124420461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 1213124420461 its reverse (1640244213121), we get a palindrome (2853368633582).
The spelling of 1213124420461 in words is "one trillion, two hundred thirteen billion, one hundred twenty-four million, four hundred twenty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •