Base | Representation |
---|---|
bin | 11110110011001111011101… |
… | …01100110111101011011101 |
3 | 22212211001102211011121121022 |
4 | 33121213232230313223131 |
5 | 32334202243032433204 |
6 | 400015203324413525 |
7 | 20160266563044242 |
oct | 1731475654675335 |
9 | 285731384147538 |
10 | 67731344030429 |
11 | 1a643779a53022 |
12 | 771a9560a72a5 |
13 | 2ba40662bc001 |
14 | 12a23009c15c9 |
15 | 7c6caae6e5be |
hex | 3d99eeb37add |
67731344030429 has 2 divisors, whose sum is σ = 67731344030430. Its totient is φ = 67731344030428.
The previous prime is 67731344030353. The next prime is 67731344030491. The reversal of 67731344030429 is 92403044313776.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46827702827929 + 20903641202500 = 6843077^2 + 4572050^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-67731344030429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (67731344030029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33865672015214 + 33865672015215.
It is an arithmetic number, because the mean of its divisors is an integer number (33865672015215).
Almost surely, 267731344030429 is an apocalyptic number.
It is an amenable number.
67731344030429 is a deficient number, since it is larger than the sum of its proper divisors (1).
67731344030429 is an equidigital number, since it uses as much as digits as its factorization.
67731344030429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9144576, while the sum is 53.
The spelling of 67731344030429 in words is "sixty-seven trillion, seven hundred thirty-one billion, three hundred forty-four million, thirty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •