Base | Representation |
---|---|
bin | 1100010100111010100011110… |
… | …0100001011001100001000101 |
3 | 11012202021122201212210011122002 |
4 | 3011032220330201121201011 |
5 | 1402143312104302013411 |
6 | 12312503444232515045 |
7 | 350465053655531201 |
oct | 30516507441314105 |
9 | 4182248655704562 |
10 | 867421200422981 |
11 | 2314292a1018666 |
12 | 81354058b4ba85 |
13 | 2b30161189a409 |
14 | 1142b5a54a9b01 |
15 | 6a4393924433b |
hex | 314ea3c859845 |
867421200422981 has 2 divisors, whose sum is σ = 867421200422982. Its totient is φ = 867421200422980.
The previous prime is 867421200422969. The next prime is 867421200423103. The reversal of 867421200422981 is 189224002124768.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 810940098540100 + 56481101882881 = 28477010^2 + 7515391^2 .
It is a cyclic number.
It is not a de Polignac number, because 867421200422981 - 210 = 867421200421957 is a prime.
It is a super-2 number, since 2×8674212004229812 (a number of 31 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (867421200422911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 433710600211490 + 433710600211491.
It is an arithmetic number, because the mean of its divisors is an integer number (433710600211491).
Almost surely, 2867421200422981 is an apocalyptic number.
It is an amenable number.
867421200422981 is a deficient number, since it is larger than the sum of its proper divisors (1).
867421200422981 is an equidigital number, since it uses as much as digits as its factorization.
867421200422981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6193152, while the sum is 56.
The spelling of 867421200422981 in words is "eight hundred sixty-seven trillion, four hundred twenty-one billion, two hundred million, four hundred twenty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •