Base | Representation |
---|---|
bin | 11110111100110101111… |
… | …11111010100001011101 |
3 | 10202122222011122201201202 |
4 | 33132122333322201131 |
5 | 114410430041240112 |
6 | 2132313502045245 |
7 | 136555315324202 |
oct | 17363277724135 |
9 | 3678864581652 |
10 | 1063457368157 |
11 | 380011a61908 |
12 | 152131879825 |
13 | 7938c0b68b2 |
14 | 3968615bca9 |
15 | 1c9e27a46c2 |
hex | f79affa85d |
1063457368157 has 2 divisors, whose sum is σ = 1063457368158. Its totient is φ = 1063457368156.
The previous prime is 1063457368139. The next prime is 1063457368159. The reversal of 1063457368157 is 7518637543601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1059559363801 + 3898004356 = 1029349^2 + 62434^2 .
It is a cyclic number.
It is not a de Polignac number, because 1063457368157 - 28 = 1063457367901 is a prime.
It is a super-2 number, since 2×10634573681572 (a number of 25 digits) contains 22 as substring.
Together with 1063457368159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1063457368159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 531728684078 + 531728684079.
It is an arithmetic number, because the mean of its divisors is an integer number (531728684079).
Almost surely, 21063457368157 is an apocalyptic number.
It is an amenable number.
1063457368157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1063457368157 is an equidigital number, since it uses as much as digits as its factorization.
1063457368157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12700800, while the sum is 56.
The spelling of 1063457368157 in words is "one trillion, sixty-three billion, four hundred fifty-seven million, three hundred sixty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •