Base | Representation |
---|---|
bin | 10011101100011111100… |
… | …10100010101001000101 |
3 | 2101200201221022111122001 |
4 | 21312033302202221011 |
5 | 42041411344201303 |
6 | 1234514254305301 |
7 | 66614544161665 |
oct | 11661762425105 |
9 | 2350657274561 |
10 | 676722256453 |
11 | 240aa6087411 |
12 | ab1a0ab8231 |
13 | 4ba789a34a9 |
14 | 24a799981a5 |
15 | 1290a6d331d |
hex | 9d8fca2a45 |
676722256453 has 2 divisors, whose sum is σ = 676722256454. Its totient is φ = 676722256452.
The previous prime is 676722256447. The next prime is 676722256471. The reversal of 676722256453 is 354652227676.
It is a happy number.
676722256453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 424011950244 + 252710306209 = 651162^2 + 502703^2 .
It is a cyclic number.
It is not a de Polignac number, because 676722256453 - 225 = 676688702021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 676722256394 and 676722256403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (676722256403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 338361128226 + 338361128227.
It is an arithmetic number, because the mean of its divisors is an integer number (338361128227).
Almost surely, 2676722256453 is an apocalyptic number.
It is an amenable number.
676722256453 is a deficient number, since it is larger than the sum of its proper divisors (1).
676722256453 is an equidigital number, since it uses as much as digits as its factorization.
676722256453 is an evil number, because the sum of its binary digits is even.
The product of its digits is 25401600, while the sum is 55.
The spelling of 676722256453 in words is "six hundred seventy-six billion, seven hundred twenty-two million, two hundred fifty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •