Base | Representation |
---|---|
bin | 111000110101110111… |
… | …1001011010111110110 |
3 | 102200002000212110121110 |
4 | 1301223233023113312 |
5 | 3444443023120000 |
6 | 132024315055450 |
7 | 11550632045244 |
oct | 1615357132766 |
9 | 380060773543 |
10 | 122066613750 |
11 | 4784a46a674 |
12 | 1b7a7a41586 |
13 | b6843b5b43 |
14 | 5c9d9c1794 |
15 | 3296625850 |
hex | 1c6bbcb5f6 |
122066613750 has 80 divisors (see below), whose sum is σ = 305521951680. Its totient is φ = 32502756000.
The previous prime is 122066613743. The next prime is 122066613787. The reversal of 122066613750 is 57316660221.
It is a junction number, because it is equal to n+sod(n) for n = 122066613699 and 122066613708.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2537421 + ... + 2585079.
It is an arithmetic number, because the mean of its divisors is an integer number (3819024396).
Almost surely, 2122066613750 is an apocalyptic number.
122066613750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 122066613750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152760975840).
122066613750 is an abundant number, since it is smaller than the sum of its proper divisors (183455337930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122066613750 is an equidigital number, since it uses as much as digits as its factorization.
122066613750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48367 (or 48352 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The spelling of 122066613750 in words is "one hundred twenty-two billion, sixty-six million, six hundred thirteen thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •