Base | Representation |
---|---|
bin | 11000001001111011101010… |
… | …100000010101111001011001 |
3 | 111221011000210111011002122022 |
4 | 120021323222200111321121 |
5 | 102411031110243233410 |
6 | 1013535553015504225 |
7 | 31243162401662363 |
oct | 3011735240257131 |
9 | 457130714132568 |
10 | 106235655446105 |
11 | 30939319a3a159 |
12 | bab9222088075 |
13 | 4737c967586c3 |
14 | 1c33b94289d33 |
15 | c4367707d455 |
hex | 609eea815e59 |
106235655446105 has 32 divisors (see below), whose sum is σ = 135284953144320. Its totient is φ = 79912701330880.
The previous prime is 106235655446093. The next prime is 106235655446117. The reversal of 106235655446105 is 501644556532601.
It is an interprime number because it is at equal distance from previous prime (106235655446093) and next prime (106235655446117).
It is not a de Polignac number, because 106235655446105 - 212 = 106235655442009 is a prime.
It is a super-2 number, since 2×1062356554461052 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 203363774 + ... + 203885496.
It is an arithmetic number, because the mean of its divisors is an integer number (4227654785760).
Almost surely, 2106235655446105 is an apocalyptic number.
It is an amenable number.
106235655446105 is a deficient number, since it is larger than the sum of its proper divisors (29049297698215).
106235655446105 is a wasteful number, since it uses less digits than its factorization.
106235655446105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551821.
The product of its (nonzero) digits is 12960000, while the sum is 53.
The spelling of 106235655446105 in words is "one hundred six trillion, two hundred thirty-five billion, six hundred fifty-five million, four hundred forty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •