Base | Representation |
---|---|
bin | 1110100111110… |
… | …01010100000000 |
3 | 22112210120101211 |
4 | 13103321110000 |
5 | 222344443000 |
6 | 20100535504 |
7 | 3016362445 |
oct | 723712400 |
9 | 275716354 |
10 | 122656000 |
11 | 632662a5 |
12 | 350b1594 |
13 | 1c546b1c |
14 | 1240b9cc |
15 | ab7c7ba |
hex | 74f9500 |
122656000 has 72 divisors (see below), whose sum is σ = 305631144. Its totient is φ = 49049600.
The previous prime is 122655977. The next prime is 122656013. The reversal of 122656000 is 656221.
122656000 is nontrivially palindromic in base 15.
It can be written as a sum of positive squares in 4 ways, for example, as 15492096 + 107163904 = 3936^2 + 10352^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30084 + ... + 33916.
It is an arithmetic number, because the mean of its divisors is an integer number (4244877).
Almost surely, 2122656000 is an apocalyptic number.
122656000 is a gapful number since it is divisible by the number (10) 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 122656000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152815572).
122656000 is an abundant number, since it is smaller than the sum of its proper divisors (182975144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122656000 is an frugal number, since it uses more digits than its factorization.
122656000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3864 (or 3840 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 122656000 is about 11075.0169300096. The cubic root of 122656000 is about 496.8549251544.
The spelling of 122656000 in words is "one hundred twenty-two million, six hundred fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •