Base | Representation |
---|---|
bin | 11000001110000000011001… |
… | …111010001010001001110000 |
3 | 111222010210102221122202222222 |
4 | 120032000121322022021300 |
5 | 102430122444121222021 |
6 | 1014312334005220212 |
7 | 31302333310114226 |
oct | 3016003172121160 |
9 | 458123387582888 |
10 | 106515623617136 |
11 | 30a370277478a8 |
12 | bb43536a01668 |
13 | 47584c3417076 |
14 | 1c43552bbcb16 |
15 | c4aab0cd56ab |
hex | 60e019e8a270 |
106515623617136 has 20 divisors (see below), whose sum is σ = 206735446381464. Its totient is φ = 53164540680000.
The previous prime is 106515623617133. The next prime is 106515623617157. The reversal of 106515623617136 is 631716326515601.
It is a super-2 number, since 2×1065156236171362 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106515623617133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5829436115 + ... + 5829454386.
Almost surely, 2106515623617136 is an apocalyptic number.
106515623617136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106515623617136 is a deficient number, since it is larger than the sum of its proper divisors (100219822764328).
106515623617136 is a wasteful number, since it uses less digits than its factorization.
106515623617136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11658891080 (or 11658891074 counting only the distinct ones).
The product of its (nonzero) digits is 4082400, while the sum is 53.
The spelling of 106515623617136 in words is "one hundred six trillion, five hundred fifteen billion, six hundred twenty-three million, six hundred seventeen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •