Base | Representation |
---|---|
bin | 11000000111111110010011… |
… | …011101001010101110101101 |
3 | 111220200011100200011021001122 |
4 | 120013332103131022232231 |
5 | 102401324423024304330 |
6 | 1013354052215350325 |
7 | 31230355645105064 |
oct | 3007762335125655 |
9 | 456604320137048 |
10 | 106101051009965 |
11 | 30897226279000 |
12 | ba971173823a5 |
13 | 472839497265b |
14 | 1c2b46548b1db |
15 | c3ede9d9c5e5 |
hex | 607f9374abad |
106101051009965 has 16 divisors (see below), whose sum is σ = 140043821507136. Its totient is φ = 77164400729680.
The previous prime is 106101051009959. The next prime is 106101051009971. The reversal of 106101051009965 is 569900150101601.
It is an interprime number because it is at equal distance from previous prime (106101051009959) and next prime (106101051009971).
It is not a de Polignac number, because 106101051009965 - 218 = 106101050747821 is a prime.
It is a super-2 number, since 2×1061010510099652 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7971522347 + ... + 7971535656.
It is an arithmetic number, because the mean of its divisors is an integer number (8752738844196).
Almost surely, 2106101051009965 is an apocalyptic number.
It is an amenable number.
106101051009965 is a deficient number, since it is larger than the sum of its proper divisors (33942770497171).
106101051009965 is an equidigital number, since it uses as much as digits as its factorization.
106101051009965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15943058041 (or 15943058019 counting only the distinct ones).
The product of its (nonzero) digits is 72900, while the sum is 44.
The spelling of 106101051009965 in words is "one hundred six trillion, one hundred one billion, fifty-one million, nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •