Base | Representation |
---|---|
bin | 110000001100111100110… |
… | …100001100110110001001 |
3 | 102201122222122102222101011 |
4 | 300030330310030312021 |
5 | 413232334131233111 |
6 | 11013414115123521 |
7 | 461213232210262 |
oct | 60147464146611 |
9 | 12648878388334 |
10 | 3312440102281 |
11 | 106788609aa42 |
12 | 455b815a35a1 |
13 | 1b0491a35b7b |
14 | b6474299969 |
15 | 5b26e109021 |
hex | 3033cd0cd89 |
3312440102281 has 2 divisors, whose sum is σ = 3312440102282. Its totient is φ = 3312440102280.
The previous prime is 3312440102267. The next prime is 3312440102347. The reversal of 3312440102281 is 1822010442133.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2104878672400 + 1207561429881 = 1450820^2 + 1098891^2 .
It is a cyclic number.
It is not a de Polignac number, because 3312440102281 - 229 = 3311903231369 is a prime.
It is a super-2 number, since 2×33124401022812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3312440102221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656220051140 + 1656220051141.
It is an arithmetic number, because the mean of its divisors is an integer number (1656220051141).
Almost surely, 23312440102281 is an apocalyptic number.
It is an amenable number.
3312440102281 is a deficient number, since it is larger than the sum of its proper divisors (1).
3312440102281 is an equidigital number, since it uses as much as digits as its factorization.
3312440102281 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.
The spelling of 3312440102281 in words is "three trillion, three hundred twelve billion, four hundred forty million, one hundred two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •