Base | Representation |
---|---|
bin | 111001001011101100… |
… | …1010010110111100000 |
3 | 102201222002010100020220 |
4 | 1302113121102313200 |
5 | 4002443030343114 |
6 | 132225122203040 |
7 | 11605034625201 |
oct | 1622731226740 |
9 | 381862110226 |
10 | 122799074784 |
11 | 48095970471 |
12 | 1b9711b3480 |
13 | b77007c439 |
14 | 5d2cda95a8 |
15 | 32daaab0a9 |
hex | 1c97652de0 |
122799074784 has 192 divisors, whose sum is σ = 345753225216. Its totient is φ = 38071148544.
The previous prime is 122799074747. The next prime is 122799074803. The reversal of 122799074784 is 487470997221.
It is a super-2 number, since 2×1227990747842 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16289064 + ... + 16296600.
It is an arithmetic number, because the mean of its divisors is an integer number (1800798048).
Almost surely, 2122799074784 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122799074784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172876612608).
122799074784 is an abundant number, since it is smaller than the sum of its proper divisors (222954150432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122799074784 is a wasteful number, since it uses less digits than its factorization.
122799074784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7777 (or 7769 counting only the distinct ones).
The product of its (nonzero) digits is 14224896, while the sum is 60.
The spelling of 122799074784 in words is "one hundred twenty-two billion, seven hundred ninety-nine million, seventy-four thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •