Base | Representation |
---|---|
bin | 11011110111011010011101… |
… | …000010100110111000100010 |
3 | 121001221011110210201001111220 |
4 | 123313122131002212320202 |
5 | 112030421103232434110 |
6 | 1112353032432315510 |
7 | 34546215612631131 |
oct | 3367323502467042 |
9 | 531834423631456 |
10 | 122555231530530 |
11 | 36060422210897 |
12 | 118b40370a2b96 |
13 | 534cba7684206 |
14 | 22399c21a3918 |
15 | e27e22049370 |
hex | 6f769d0a6e22 |
122555231530530 has 128 divisors (see below), whose sum is σ = 305193668832000. Its totient is φ = 31459220373504.
The previous prime is 122555231530513. The next prime is 122555231530549. The reversal of 122555231530530 is 35035132555221.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1796252277 + ... + 1796320503.
It is an arithmetic number, because the mean of its divisors is an integer number (2384325537750).
Almost surely, 2122555231530530 is an apocalyptic number.
122555231530530 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 122555231530530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152596834416000).
122555231530530 is an abundant number, since it is smaller than the sum of its proper divisors (182638437301470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122555231530530 is a wasteful number, since it uses less digits than its factorization.
122555231530530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74468.
The product of its (nonzero) digits is 675000, while the sum is 42.
The spelling of 122555231530530 in words is "one hundred twenty-two trillion, five hundred fifty-five billion, two hundred thirty-one million, five hundred thirty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •