Base | Representation |
---|---|
bin | 1110100101100… |
… | …00110100011100 |
3 | 22112020111002100 |
4 | 13102300310130 |
5 | 222310442233 |
6 | 20050325100 |
7 | 3014014656 |
oct | 722606434 |
9 | 275214070 |
10 | 122359068 |
11 | 630831a7 |
12 | 34b89790 |
13 | 1c471920 |
14 | 123716d6 |
15 | ab1e813 |
hex | 74b0d1c |
122359068 has 36 divisors (see below), whose sum is σ = 333089848. Its totient is φ = 37648800.
The previous prime is 122359067. The next prime is 122359073. The reversal of 122359068 is 860953221.
122359068 is a `hidden beast` number, since 1 + 2 + 2 + 3 + 590 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122359067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 130258 + ... + 131193.
Almost surely, 2122359068 is an apocalyptic number.
122359068 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
122359068 is an abundant number, since it is smaller than the sum of its proper divisors (210730780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122359068 is a wasteful number, since it uses less digits than its factorization.
122359068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261474 (or 261469 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 122359068 is about 11061.6033195916. The cubic root of 122359068 is about 496.4536637998.
The spelling of 122359068 in words is "one hundred twenty-two million, three hundred fifty-nine thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •