Base | Representation |
---|---|
bin | 1100011010001110… |
… | …0110100011010001 |
3 | 22121011021121002222 |
4 | 3012203212203101 |
5 | 23310243043323 |
6 | 1310315350425 |
7 | 145356626441 |
oct | 30643464321 |
9 | 8534247088 |
10 | 3331221713 |
11 | 145a42a1a6 |
12 | 78b752415 |
13 | 4111c4411 |
14 | 2385c6121 |
15 | 1476bd9c8 |
hex | c68e68d1 |
3331221713 has 2 divisors, whose sum is σ = 3331221714. Its totient is φ = 3331221712.
The previous prime is 3331221659. The next prime is 3331221731. The reversal of 3331221713 is 3171221333.
Together with next prime (3331221731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2921078209 + 410143504 = 54047^2 + 20252^2 .
It is a cyclic number.
It is not a de Polignac number, because 3331221713 - 210 = 3331220689 is a prime.
It is a super-2 number, since 2×33312217132 = 22194076202325308738, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (3331221743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1665610856 + 1665610857.
It is an arithmetic number, because the mean of its divisors is an integer number (1665610857).
Almost surely, 23331221713 is an apocalyptic number.
It is an amenable number.
3331221713 is a deficient number, since it is larger than the sum of its proper divisors (1).
3331221713 is an equidigital number, since it uses as much as digits as its factorization.
3331221713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2268, while the sum is 26.
The square root of 3331221713 is about 57716.7368533600. The cubic root of 3331221713 is about 1493.4860813751.
The spelling of 3331221713 in words is "three billion, three hundred thirty-one million, two hundred twenty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •