Base | Representation |
---|---|
bin | 11011110111011001100110… |
… | …010011100000010001110101 |
3 | 121001221002002210201200202012 |
4 | 123313121212103200101311 |
5 | 112030412213140304140 |
6 | 1112352401345454005 |
7 | 34546154062231520 |
oct | 3367314623402165 |
9 | 531832083650665 |
10 | 122554313213045 |
11 | 3605aaa090831a |
12 | 118b3a1b641305 |
13 | 534ca8c34619c |
14 | 2239936239bb7 |
15 | e27dbb600265 |
hex | 6f76664e0475 |
122554313213045 has 16 divisors (see below), whose sum is σ = 168099280421760. Its totient is φ = 84024846481344.
The previous prime is 122554313213039. The next prime is 122554313213053. The reversal of 122554313213045 is 540312313455221.
It is a cyclic number.
It is not a de Polignac number, because 122554313213045 - 24 = 122554313213029 is a prime.
It is a super-2 number, since 2×1225543132130452 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122554313212993 and 122554313213011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 258027362 + ... + 258501891.
It is an arithmetic number, because the mean of its divisors is an integer number (10506205026360).
Almost surely, 2122554313213045 is an apocalyptic number.
It is an amenable number.
122554313213045 is a deficient number, since it is larger than the sum of its proper divisors (45544967208715).
122554313213045 is an equidigital number, since it uses as much as digits as its factorization.
122554313213045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516536044.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 122554313213045 its reverse (540312313455221), we get a palindrome (662866626668266).
The spelling of 122554313213045 in words is "one hundred twenty-two trillion, five hundred fifty-four billion, three hundred thirteen million, two hundred thirteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •