Base | Representation |
---|---|
bin | 11110111100001110010… |
… | …10100111111100101101 |
3 | 10202122002222112221121222 |
4 | 33132013022213330231 |
5 | 114404234401200331 |
6 | 2132220454233125 |
7 | 136544135160053 |
oct | 17360712477455 |
9 | 3678088487558 |
10 | 1063124631341 |
11 | 37a961158803 |
12 | 15205a3557a5 |
13 | 793381961c6 |
14 | 39653ca61d3 |
15 | 1c9c347ab7b |
hex | f7872a7f2d |
1063124631341 has 2 divisors, whose sum is σ = 1063124631342. Its totient is φ = 1063124631340.
The previous prime is 1063124631313. The next prime is 1063124631367. The reversal of 1063124631341 is 1431364213601.
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., 754038669316 + 309085962025 = 868354^2 + 555955^2 .
It is a cyclic number.
It is not a de Polignac number, because 1063124631341 - 226 = 1063057522477 is a prime.
It is a super-2 number, since 2×10631246313412 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1063124631841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 531562315670 + 531562315671.
It is an arithmetic number, because the mean of its divisors is an integer number (531562315671).
Almost surely, 21063124631341 is an apocalyptic number.
It is an amenable number.
1063124631341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1063124631341 is an equidigital number, since it uses as much as digits as its factorization.
1063124631341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 1063124631341 its reverse (1431364213601), we get a palindrome (2494488844942).
The spelling of 1063124631341 in words is "one trillion, sixty-three billion, one hundred twenty-four million, six hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •