Base | Representation |
---|---|
bin | 110000001010111110000… |
… | …0101100000110100011101 |
3 | 212102220222211122110112121 |
4 | 1200111330011200310131 |
5 | 1331433020331014234 |
6 | 22025250201102541 |
7 | 1252216203032341 |
oct | 140257405406435 |
9 | 25386884573477 |
10 | 6620626423069 |
11 | 212287901a98a |
12 | 8ab156487a51 |
13 | 3904263b2669 |
14 | 18c62361d621 |
15 | b733ea5d4b4 |
hex | 6057c160d1d |
6620626423069 has 2 divisors, whose sum is σ = 6620626423070. Its totient is φ = 6620626423068.
The previous prime is 6620626423039. The next prime is 6620626423139. The reversal of 6620626423069 is 9603246260266.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5880561950169 + 740064472900 = 2424987^2 + 860270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6620626423069 is a prime.
It is a super-2 number, since 2×66206264230692 (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 (6620626423039) 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, 3310313211534 + 3310313211535.
It is an arithmetic number, because the mean of its divisors is an integer number (3310313211535).
Almost surely, 26620626423069 is an apocalyptic number.
It is an amenable number.
6620626423069 is a deficient number, since it is larger than the sum of its proper divisors (1).
6620626423069 is an equidigital number, since it uses as much as digits as its factorization.
6620626423069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6718464, while the sum is 52.
The spelling of 6620626423069 in words is "six trillion, six hundred twenty billion, six hundred twenty-six million, four hundred twenty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •