Base | Representation |
---|---|
bin | 11000001111110111010110… |
… | …101001000101011111011000 |
3 | 111222121000010000020220010201 |
4 | 120033313112221011133120 |
5 | 102434221032041241000 |
6 | 1014451135334151544 |
7 | 31314504324154150 |
oct | 3017672651053730 |
9 | 458530100226121 |
10 | 106643344087000 |
11 | 30a86208607226 |
12 | bb642401b25b4 |
13 | 4767568c629a6 |
14 | 1c497cb627760 |
15 | c4e08896c96a |
hex | 60fdd6a457d8 |
106643344087000 has 128 divisors (see below), whose sum is σ = 291262746378240. Its totient is φ = 35785486780800.
The previous prime is 106643344086989. The next prime is 106643344087001. The reversal of 106643344087000 is 780443346601.
It is a super-2 number, since 2×1066433440870002 (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 (106643344087001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 161742952 + ... + 162400951.
It is an arithmetic number, because the mean of its divisors is an integer number (2275490206080).
Almost surely, 2106643344087000 is an apocalyptic number.
106643344087000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106643344087000 is an abundant number, since it is smaller than the sum of its proper divisors (184619402291240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106643344087000 is a wasteful number, since it uses less digits than its factorization.
106643344087000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324143978 (or 324143964 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 46.
The spelling of 106643344087000 in words is "one hundred six trillion, six hundred forty-three billion, three hundred forty-four million, eighty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •