Base | Representation |
---|---|
bin | 10011100110001011101… |
… | …01100001010110100001 |
3 | 2101100222210210021101122 |
4 | 21303011311201112201 |
5 | 42012442003234334 |
6 | 1233154141142025 |
7 | 66434562622553 |
oct | 11630565412641 |
9 | 2340883707348 |
10 | 673334039969 |
11 | 23a61756a1a8 |
12 | aa5b625a915 |
13 | 4b658a44c76 |
14 | 248379b74d3 |
15 | 127ad00732e |
hex | 9cc5d615a1 |
673334039969 has 2 divisors, whose sum is σ = 673334039970. Its totient is φ = 673334039968.
The previous prime is 673334039957. The next prime is 673334039971. The reversal of 673334039969 is 969930433376.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 522059716369 + 151274323600 = 722537^2 + 388940^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-673334039969 is a prime.
It is a super-2 number, since 2×6733340399692 (a number of 24 digits) contains 22 as substring.
Together with 673334039971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (673334039269) 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, 336667019984 + 336667019985.
It is an arithmetic number, because the mean of its divisors is an integer number (336667019985).
Almost surely, 2673334039969 is an apocalyptic number.
It is an amenable number.
673334039969 is a deficient number, since it is larger than the sum of its proper divisors (1).
673334039969 is an equidigital number, since it uses as much as digits as its factorization.
673334039969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 59521392, while the sum is 62.
The spelling of 673334039969 in words is "six hundred seventy-three billion, three hundred thirty-four million, thirty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •