Base | Representation |
---|---|
bin | 111001011010011000010… |
… | …000100001100010111101 |
3 | 111222011121010210211202222 |
4 | 321122120100201202331 |
5 | 1004120021104240034 |
6 | 12220243413255125 |
7 | 555020031316646 |
oct | 71323020414275 |
9 | 14864533724688 |
10 | 3945334446269 |
11 | 1291230492a97 |
12 | 5387706344a5 |
13 | 228074598938 |
14 | d8d5312a6cd |
15 | 6c961c2412e |
hex | 396984218bd |
3945334446269 has 2 divisors, whose sum is σ = 3945334446270. Its totient is φ = 3945334446268.
The previous prime is 3945334446197. The next prime is 3945334446283. The reversal of 3945334446269 is 9626444335493.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2347544908900 + 1597789537369 = 1532170^2 + 1264037^2 .
It is a cyclic number.
It is not a de Polignac number, because 3945334446269 - 220 = 3945333397693 is a prime.
It is a super-2 number, since 2×39453344462692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3945334446289) 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, 1972667223134 + 1972667223135.
It is an arithmetic number, because the mean of its divisors is an integer number (1972667223135).
Almost surely, 23945334446269 is an apocalyptic number.
It is an amenable number.
3945334446269 is a deficient number, since it is larger than the sum of its proper divisors (1).
3945334446269 is an equidigital number, since it uses as much as digits as its factorization.
3945334446269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 201553920, while the sum is 62.
The spelling of 3945334446269 in words is "three trillion, nine hundred forty-five billion, three hundred thirty-four million, four hundred forty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •