Base | Representation |
---|---|
bin | 11011110111011001100001… |
… | …011010010111010110011001 |
3 | 121001221001220002021012200002 |
4 | 123313121201122113112121 |
5 | 112030412031132003101 |
6 | 1112352345254222345 |
7 | 34546152044422115 |
oct | 3367314132272631 |
9 | 531831802235602 |
10 | 122554231125401 |
11 | 3605aa59540699 |
12 | 118b39b80549b5 |
13 | 534ca7833480a |
14 | 223992938c745 |
15 | e27db42d7d6b |
hex | 6f7661697599 |
122554231125401 has 4 divisors (see below), whose sum is σ = 122560136520372. Its totient is φ = 122548325730432.
The previous prime is 122554231125383. The next prime is 122554231125421. The reversal of 122554231125401 is 104521132455221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39832204748176 + 82722026377225 = 6311276^2 + 9095165^2 .
It is a cyclic number.
It is not a de Polignac number, because 122554231125401 - 238 = 122279353218457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122554231125421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2952666356 + ... + 2952707861.
It is an arithmetic number, because the mean of its divisors is an integer number (30640034130093).
Almost surely, 2122554231125401 is an apocalyptic number.
It is an amenable number.
122554231125401 is a deficient number, since it is larger than the sum of its proper divisors (5905394971).
122554231125401 is an equidigital number, since it uses as much as digits as its factorization.
122554231125401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5905394970.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 122554231125401 in words is "one hundred twenty-two trillion, five hundred fifty-four billion, two hundred thirty-one million, one hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •