Base | Representation |
---|---|
bin | 111001001001110100… |
… | …1001001010011000011 |
3 | 102201210200122221221021 |
4 | 1302103221021103003 |
5 | 4002330421333102 |
6 | 132214553010311 |
7 | 11603341546432 |
oct | 1622351112303 |
9 | 381720587837 |
10 | 122736121027 |
11 | 48063382373 |
12 | 1b9540b3997 |
13 | b760009bb0 |
14 | 5d2489d119 |
15 | 32d52c3137 |
hex | 1c93a494c3 |
122736121027 has 8 divisors (see below), whose sum is σ = 132181604240. Its totient is φ = 113291244000.
The previous prime is 122736121009. The next prime is 122736121033. The reversal of 122736121027 is 720121637221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122736121027 - 211 = 122736118979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122736120983 and 122736121001.
It is not an unprimeable number, because it can be changed into a prime (122736821027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 324349 + ... + 592177.
It is an arithmetic number, because the mean of its divisors is an integer number (16522700530).
Almost surely, 2122736121027 is an apocalyptic number.
122736121027 is a deficient number, since it is larger than the sum of its proper divisors (9445483213).
122736121027 is a wasteful number, since it uses less digits than its factorization.
122736121027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303093.
The product of its (nonzero) digits is 14112, while the sum is 34.
Adding to 122736121027 its reverse (720121637221), we get a palindrome (842857758248).
The spelling of 122736121027 in words is "one hundred twenty-two billion, seven hundred thirty-six million, one hundred twenty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •