Base | Representation |
---|---|
bin | 10001110010010100001100… |
… | …00010111011001111110001 |
3 | 12010111002110221022201002022 |
4 | 20321022012002323033301 |
5 | 20111303312101030111 |
6 | 215103523433401225 |
7 | 11144523205022153 |
oct | 1071120602731761 |
9 | 163432427281068 |
10 | 39112221111281 |
11 | 1150a44418904a |
12 | 4478263869215 |
13 | 18a9360a0c666 |
14 | 99308222aad3 |
15 | 47c5ea58a2db |
hex | 2392860bb3f1 |
39112221111281 has 2 divisors, whose sum is σ = 39112221111282. Its totient is φ = 39112221111280.
The previous prime is 39112221111263. The next prime is 39112221111343. The reversal of 39112221111281 is 18211112221193.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 37542775910656 + 1569445200625 = 6127216^2 + 1252775^2 .
It is an emirp because it is prime and its reverse (18211112221193) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 39112221111281 - 222 = 39112216916977 is a prime.
It is a super-2 number, since 2×391122211112812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (39112221111221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19556110555640 + 19556110555641.
It is an arithmetic number, because the mean of its divisors is an integer number (19556110555641).
Almost surely, 239112221111281 is an apocalyptic number.
It is an amenable number.
39112221111281 is a deficient number, since it is larger than the sum of its proper divisors (1).
39112221111281 is an equidigital number, since it uses as much as digits as its factorization.
39112221111281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3456, while the sum is 35.
The spelling of 39112221111281 in words is "thirty-nine trillion, one hundred twelve billion, two hundred twenty-one million, one hundred eleven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •