Base | Representation |
---|---|
bin | 110011000010101100… |
… | …0100110010110101001 |
3 | 101110221001022120100221 |
4 | 1212011120212112221 |
5 | 3243441133010211 |
6 | 122204405330041 |
7 | 10630200430051 |
oct | 1460530462651 |
9 | 343831276327 |
10 | 109612000681 |
11 | 42539131517 |
12 | 192b0a06921 |
13 | a44accaa01 |
14 | 543b864561 |
15 | 2cb8004c71 |
hex | 19856265a9 |
109612000681 has 2 divisors, whose sum is σ = 109612000682. Its totient is φ = 109612000680.
The previous prime is 109612000679. The next prime is 109612000717. The reversal of 109612000681 is 186000216901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88613382400 + 20998618281 = 297680^2 + 144909^2 .
It is a cyclic number.
It is not a de Polignac number, because 109612000681 - 21 = 109612000679 is a prime.
It is a super-2 number, since 2×1096120006812 (a number of 23 digits) contains 22 as substring.
Together with 109612000679, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (109615000681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54806000340 + 54806000341.
It is an arithmetic number, because the mean of its divisors is an integer number (54806000341).
Almost surely, 2109612000681 is an apocalyptic number.
109612000681 is the 209392-nd centered pentagonal number.
It is an amenable number.
109612000681 is a deficient number, since it is larger than the sum of its proper divisors (1).
109612000681 is an equidigital number, since it uses as much as digits as its factorization.
109612000681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 34.
The spelling of 109612000681 in words is "one hundred nine billion, six hundred twelve million, six hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •