Base | Representation |
---|---|
bin | 110001011010001100… |
… | …0110000111111101010 |
3 | 101010212200102021021210 |
4 | 1202310120300333222 |
5 | 3214301013343442 |
6 | 120424431213550 |
7 | 10444252525305 |
oct | 1426430607752 |
9 | 333780367253 |
10 | 106105606122 |
11 | 40aa993737a |
12 | 186926772b6 |
13 | a00c732929 |
14 | 51c7cbdb3c |
15 | 2b6028319c |
hex | 18b4630fea |
106105606122 has 8 divisors (see below), whose sum is σ = 212211212256. Its totient is φ = 35368535372.
The previous prime is 106105606099. The next prime is 106105606127. The reversal of 106105606122 is 221606501601.
It is a sphenic number, since it is the product of 3 distinct primes.
106105606122 is an admirable number.
It is a super-2 number, since 2×1061056061222 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106105606122.
It is not an unprimeable number, because it can be changed into a prime (106105606127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8842133838 + ... + 8842133849.
It is an arithmetic number, because the mean of its divisors is an integer number (26526401532).
Almost surely, 2106105606122 is an apocalyptic number.
106105606122 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.
106105606122 is a wasteful number, since it uses less digits than its factorization.
106105606122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17684267692.
The product of its (nonzero) digits is 4320, while the sum is 30.
The spelling of 106105606122 in words is "one hundred six billion, one hundred five million, six hundred six thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •