Base | Representation |
---|---|
bin | 110011001111011000000… |
… | …0100100001111010110101 |
3 | 220221020200100011020222111 |
4 | 1212132300010201322311 |
5 | 1410340321234010134 |
6 | 22551123015531021 |
7 | 1324540241004106 |
oct | 146366004417265 |
9 | 26836610136874 |
10 | 7042405375669 |
11 | 227573826a764 |
12 | 958a47389a71 |
13 | 3c1132b295b1 |
14 | 1a4bd60623ad |
15 | c32c846ec64 |
hex | 667b0121eb5 |
7042405375669 has 2 divisors, whose sum is σ = 7042405375670. Its totient is φ = 7042405375668.
The previous prime is 7042405375487. The next prime is 7042405375673. The reversal of 7042405375669 is 9665735042407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6426985522500 + 615419853169 = 2535150^2 + 784487^2 .
It is an emirp because it is prime and its reverse (9665735042407) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7042405375669 - 213 = 7042405367477 is a prime.
It is a super-2 number, since 2×70424053756692 (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 (7042405175669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3521202687834 + 3521202687835.
It is an arithmetic number, because the mean of its divisors is an integer number (3521202687835).
Almost surely, 27042405375669 is an apocalyptic number.
It is an amenable number.
7042405375669 is a deficient number, since it is larger than the sum of its proper divisors (1).
7042405375669 is an equidigital number, since it uses as much as digits as its factorization.
7042405375669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38102400, while the sum is 58.
The spelling of 7042405375669 in words is "seven trillion, forty-two billion, four hundred five million, three hundred seventy-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •