Base | Representation |
---|---|
bin | 10010001110110100100… |
… | …10000011010010101001 |
3 | 2012212221011010021100212 |
4 | 21013122102003102221 |
5 | 40230413200014311 |
6 | 1155440140510505 |
7 | 63154402511663 |
oct | 11073222032251 |
9 | 2185834107325 |
10 | 626432423081 |
11 | 221739854253 |
12 | a14a6b4b435 |
13 | 470c2b8533a |
14 | 2246897d533 |
15 | 1146568bc8b |
hex | 91da4834a9 |
626432423081 has 2 divisors, whose sum is σ = 626432423082. Its totient is φ = 626432423080.
The previous prime is 626432423063. The next prime is 626432423083. The reversal of 626432423081 is 180324234626.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 478980263056 + 147452160025 = 692084^2 + 383995^2 .
It is a cyclic number.
It is not a de Polignac number, because 626432423081 - 26 = 626432423017 is a prime.
It is a super-2 number, since 2×6264324230812 (a number of 24 digits) contains 22 as substring.
Together with 626432423083, 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 (626432423083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 313216211540 + 313216211541.
It is an arithmetic number, because the mean of its divisors is an integer number (313216211541).
Almost surely, 2626432423081 is an apocalyptic number.
It is an amenable number.
626432423081 is a deficient number, since it is larger than the sum of its proper divisors (1).
626432423081 is an equidigital number, since it uses as much as digits as its factorization.
626432423081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 41.
The spelling of 626432423081 in words is "six hundred twenty-six billion, four hundred thirty-two million, four hundred twenty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •