Base | Representation |
---|---|
bin | 11000001010000010001010… |
… | …110101101001010011110110 |
3 | 111221011200211021111002220020 |
4 | 120022002022311221103312 |
5 | 102411134411412240002 |
6 | 1013543110054350010 |
7 | 31243530445466103 |
oct | 3012021265512366 |
9 | 457150737432806 |
10 | 106242640352502 |
11 | 30941283814775 |
12 | baba65135b306 |
13 | 473883a8a8504 |
14 | 1c34257bd7aaa |
15 | c439353b52bc |
hex | 60a08ad694f6 |
106242640352502 has 8 divisors (see below), whose sum is σ = 212485280705016. Its totient is φ = 35414213450832.
The previous prime is 106242640352477. The next prime is 106242640352507. The reversal of 106242640352502 is 205253046242601.
It is a sphenic number, since it is the product of 3 distinct primes.
106242640352502 is an admirable number.
It is a super-2 number, since 2×1062426403525022 (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 (106242640352507) 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, 8853553362703 + ... + 8853553362714.
It is an arithmetic number, because the mean of its divisors is an integer number (26560660088127).
Almost surely, 2106242640352502 is an apocalyptic number.
106242640352502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106242640352502 is a wasteful number, since it uses less digits than its factorization.
106242640352502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17707106725422.
The product of its (nonzero) digits is 691200, while the sum is 42.
The spelling of 106242640352502 in words is "one hundred six trillion, two hundred forty-two billion, six hundred forty million, three hundred fifty-two thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •