Base | Representation |
---|---|
bin | 11000001001101111100001… |
… | …101010010010000011110101 |
3 | 111221002210011011201022100211 |
4 | 120021233201222102003311 |
5 | 102410322412232424442 |
6 | 1013525555435105421 |
7 | 31242221412561205 |
oct | 3011574152220365 |
9 | 457083134638324 |
10 | 106222622154997 |
11 | 30933840a96697 |
12 | bab67a52a2271 |
13 | 473699a4cba2a |
14 | 1c332b9336405 |
15 | c43162c52617 |
hex | 609be1a920f5 |
106222622154997 has 8 divisors (see below), whose sum is σ = 108817257088512. Its totient is φ = 103628170044000.
The previous prime is 106222622154989. The next prime is 106222622155009. The reversal of 106222622154997 is 799451226222601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106222622154997 - 23 = 106222622154989 is a prime.
It is a super-2 number, since 2×1062226221549972 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106222622154907) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44529043 + ... + 46853824.
It is an arithmetic number, because the mean of its divisors is an integer number (13602157136064).
Almost surely, 2106222622154997 is an apocalyptic number.
It is an amenable number.
106222622154997 is a deficient number, since it is larger than the sum of its proper divisors (2594634933515).
106222622154997 is an equidigital number, since it uses as much as digits as its factorization.
106222622154997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91411259.
The product of its (nonzero) digits is 13063680, while the sum is 58.
The spelling of 106222622154997 in words is "one hundred six trillion, two hundred twenty-two billion, six hundred twenty-two million, one hundred fifty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •