Base | Representation |
---|---|
bin | 110000011111100100011… |
… | …100100010110100111001 |
3 | 102210120120221100222222021 |
4 | 300133210130202310321 |
5 | 414044310134423304 |
6 | 11030522010154441 |
7 | 462521531354356 |
oct | 60374434426471 |
9 | 12716527328867 |
10 | 3332432342329 |
11 | 10753051a9882 |
12 | 459a20a22a21 |
13 | 1b23299246cc |
14 | b740d52162d |
15 | 5ba3e340a54 |
hex | 307e4722d39 |
3332432342329 has 2 divisors, whose sum is σ = 3332432342330. Its totient is φ = 3332432342328.
The previous prime is 3332432342321. The next prime is 3332432342333. The reversal of 3332432342329 is 9232432342333.
3332432342329 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1734541680400 + 1597890661929 = 1317020^2 + 1264077^2 .
It is a cyclic number.
It is not a de Polignac number, because 3332432342329 - 23 = 3332432342321 is a prime.
It is a super-2 number, since 2×33324323423292 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3332432342321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1666216171164 + 1666216171165.
It is an arithmetic number, because the mean of its divisors is an integer number (1666216171165).
Almost surely, 23332432342329 is an apocalyptic number.
It is an amenable number.
3332432342329 is a deficient number, since it is larger than the sum of its proper divisors (1).
3332432342329 is an equidigital number, since it uses as much as digits as its factorization.
3332432342329 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1679616, while the sum is 43.
The spelling of 3332432342329 in words is "three trillion, three hundred thirty-two billion, four hundred thirty-two million, three hundred forty-two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •