Base | Representation |
---|---|
bin | 1110100011100… |
… | …11010010110000 |
3 | 22111202200101120 |
4 | 13101303102300 |
5 | 222224411211 |
6 | 20041102240 |
7 | 3011615151 |
oct | 721632260 |
9 | 274680346 |
10 | 122107056 |
11 | 62a20925 |
12 | 34a87980 |
13 | 1c3b3cc6 |
14 | 12307928 |
15 | aabed06 |
hex | 74734b0 |
122107056 has 80 divisors (see below), whose sum is σ = 336549888. Its totient is φ = 38016000.
The previous prime is 122107043. The next prime is 122107099. The reversal of 122107056 is 650701221.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 122721 + ... + 123711.
Almost surely, 2122107056 is an apocalyptic number.
122107056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122107056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168274944).
122107056 is an abundant number, since it is smaller than the sum of its proper divisors (214442832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122107056 is a wasteful number, since it uses less digits than its factorization.
122107056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170 (or 1164 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 122107056 is about 11050.2061519231. The cubic root of 122107056 is about 496.1125958393.
Adding to 122107056 its reverse (650701221), we get a palindrome (772808277).
The spelling of 122107056 in words is "one hundred twenty-two million, one hundred seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.410 sec. • engine limits •