Base | Representation |
---|---|
bin | 11000001000110110101101… |
… | …101110101001110111110101 |
3 | 111220212221200220221000122202 |
4 | 120020312231232221313311 |
5 | 102403323000030444413 |
6 | 1013441550420034245 |
7 | 31234631641333334 |
oct | 3010665556516765 |
9 | 456787626830582 |
10 | 106161621343733 |
11 | 3090a98869128a |
12 | baa6a00232985 |
13 | 4730cc860c337 |
14 | 1c3036d9a3d1b |
15 | c4179270ce58 |
hex | 608dadba9df5 |
106161621343733 has 8 divisors (see below), whose sum is σ = 113365023905280. Its totient is φ = 99194395915440.
The previous prime is 106161621343717. The next prime is 106161621343741. The reversal of 106161621343733 is 337343126161601.
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 106161621343733 - 24 = 106161621343717 is a prime.
It is a super-2 number, since 2×1061616213437332 (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 (106161621343793) 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, 59044282385 + ... + 59044284182.
It is an arithmetic number, because the mean of its divisors is an integer number (14170627988160).
Almost surely, 2106161621343733 is an apocalyptic number.
It is an amenable number.
106161621343733 is a deficient number, since it is larger than the sum of its proper divisors (7203402561547).
106161621343733 is a wasteful number, since it uses less digits than its factorization.
106161621343733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118088566627.
The product of its (nonzero) digits is 979776, while the sum is 47.
The spelling of 106161621343733 in words is "one hundred six trillion, one hundred sixty-one billion, six hundred twenty-one million, three hundred forty-three thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •