Base | Representation |
---|---|
bin | 1001101100101101100000… |
… | …0101100010000100100111 |
3 | 1101202102221222010222022102 |
4 | 2123023120011202010213 |
5 | 2344203311421020412 |
6 | 34402503555322315 |
7 | 2150300162530016 |
oct | 233133005420447 |
9 | 41672858128272 |
10 | 10663734157607 |
11 | 3441511a24543 |
12 | 1242852bb039b |
13 | 5c478006600b |
14 | 28c1adb78a7d |
15 | 1375c52758c2 |
hex | 9b2d8162127 |
10663734157607 has 2 divisors, whose sum is σ = 10663734157608. Its totient is φ = 10663734157606.
The previous prime is 10663734157577. The next prime is 10663734157663. The reversal of 10663734157607 is 70675143736601.
It is an a-pointer prime, because the next prime (10663734157663) can be obtained adding 10663734157607 to its sum of digits (56).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10663734157607 - 26 = 10663734157543 is a prime.
It is a super-2 number, since 2×106637341576072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10663734150607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5331867078803 + 5331867078804.
It is an arithmetic number, because the mean of its divisors is an integer number (5331867078804).
Almost surely, 210663734157607 is an apocalyptic number.
10663734157607 is a deficient number, since it is larger than the sum of its proper divisors (1).
10663734157607 is an equidigital number, since it uses as much as digits as its factorization.
10663734157607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13335840, while the sum is 56.
The spelling of 10663734157607 in words is "ten trillion, six hundred sixty-three billion, seven hundred thirty-four million, one hundred fifty-seven thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •