Base | Representation |
---|---|
bin | 1001100101000011001111111… |
… | …1000110010010110001110101 |
3 | 10021101122011111202201021110111 |
4 | 2121100303333012102301311 |
5 | 1201322220101000232401 |
6 | 10345333131303023021 |
7 | 261656654063654503 |
oct | 23120637706226165 |
9 | 3241564452637414 |
10 | 674056447274101 |
11 | 185858808964191 |
12 | 637247a443aa71 |
13 | 22c163339cb858 |
14 | bc64712b21673 |
15 | 52ddb4d54be51 |
hex | 2650cff192c75 |
674056447274101 has 2 divisors, whose sum is σ = 674056447274102. Its totient is φ = 674056447274100.
The previous prime is 674056447274017. The next prime is 674056447274183. The reversal of 674056447274101 is 101472744650476.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 662627138987025 + 11429308287076 = 25741545^2 + 3380726^2 .
It is a cyclic number.
It is not a de Polignac number, because 674056447274101 - 27 = 674056447273973 is a prime.
It is a super-2 number, since 2×6740564472741012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (674056447274401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 337028223637050 + 337028223637051.
It is an arithmetic number, because the mean of its divisors is an integer number (337028223637051).
Almost surely, 2674056447274101 is an apocalyptic number.
It is an amenable number.
674056447274101 is a deficient number, since it is larger than the sum of its proper divisors (1).
674056447274101 is an equidigital number, since it uses as much as digits as its factorization.
674056447274101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31610880, while the sum is 58.
The spelling of 674056447274101 in words is "six hundred seventy-four trillion, fifty-six billion, four hundred forty-seven million, two hundred seventy-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •