Base | Representation |
---|---|
bin | 11000010101000101000111… |
… | …110111101001101001111001 |
3 | 112000212021011021002012122222 |
4 | 120111011013313221221321 |
5 | 103011104013330003441 |
6 | 1015323525254453425 |
7 | 31352422343251436 |
oct | 3025050767515171 |
9 | 460767137065588 |
10 | 107001726016121 |
11 | 311041a4896a22 |
12 | 10001799664275 |
13 | 47922b1229691 |
14 | 1c5cca8382b8d |
15 | c585617b0d4b |
hex | 615147de9a79 |
107001726016121 has 2 divisors, whose sum is σ = 107001726016122. Its totient is φ = 107001726016120.
The previous prime is 107001726016109. The next prime is 107001726016127. The reversal of 107001726016121 is 121610627100701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94246506628096 + 12755219388025 = 9708064^2 + 3571445^2 .
It is an emirp because it is prime and its reverse (121610627100701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107001726016121 - 222 = 107001721821817 is a prime.
It is a super-2 number, since 2×1070017260161212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (107001726016127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53500863008060 + 53500863008061.
It is an arithmetic number, because the mean of its divisors is an integer number (53500863008061).
Almost surely, 2107001726016121 is an apocalyptic number.
It is an amenable number.
107001726016121 is a deficient number, since it is larger than the sum of its proper divisors (1).
107001726016121 is an equidigital number, since it uses as much as digits as its factorization.
107001726016121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 35.
The spelling of 107001726016121 in words is "one hundred seven trillion, one billion, seven hundred twenty-six million, sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •