Base | Representation |
---|---|
bin | 11011111000001101001100… |
… | …101111111101100011001000 |
3 | 121002010101010010120100010121 |
4 | 123320031030233331203020 |
5 | 112032314201033241300 |
6 | 1112434043300553024 |
7 | 34553155065053350 |
oct | 3370151457754310 |
9 | 532111103510117 |
10 | 122609719040200 |
11 | 36081542a73317 |
12 | 119027029b2774 |
13 | 535507c0464b2 |
14 | 223c4b08abb60 |
15 | e2956086181a |
hex | 6f834cbfd8c8 |
122609719040200 has 384 divisors, whose sum is σ = 334777010400000. Its totient is φ = 40884789657600.
The previous prime is 122609719040191. The next prime is 122609719040219. The reversal of 122609719040200 is 2040917906221.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34743472036 + ... + 34743475564.
It is an arithmetic number, because the mean of its divisors is an integer number (871815131250).
Almost surely, 2122609719040200 is an apocalyptic number.
122609719040200 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 122609719040200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167388505200000).
122609719040200 is an abundant number, since it is smaller than the sum of its proper divisors (212167291359800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122609719040200 is a wasteful number, since it uses less digits than its factorization.
122609719040200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5305 (or 5296 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 122609719040200 in words is "one hundred twenty-two trillion, six hundred nine billion, seven hundred nineteen million, forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •