Base | Representation |
---|---|
bin | 11011110011111001001001… |
… | …100000111010101010010101 |
3 | 121001002001001000110122122200 |
4 | 123303321021200322222111 |
5 | 112012440130334134031 |
6 | 1112045543153515113 |
7 | 34522562616010053 |
oct | 3363711140725225 |
9 | 531061030418580 |
10 | 122313312021141 |
11 | 35a77869a3085a |
12 | 11875180872a99 |
13 | 533313270ac17 |
14 | 222bdd2a0d1d3 |
15 | e219b38298e6 |
hex | 6f3e4983aa95 |
122313312021141 has 24 divisors (see below), whose sum is σ = 176961998553600. Its totient is φ = 81409737639456.
The previous prime is 122313312021139. The next prime is 122313312021209. The reversal of 122313312021141 is 141120213313221.
122313312021141 is a `hidden beast` number, since 1 + 2 + 2 + 313 + 3 + 1 + 202 + 1 + 141 = 666.
It is not a de Polignac number, because 122313312021141 - 21 = 122313312021139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122313312023141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12527460 + ... + 20039058.
It is an arithmetic number, because the mean of its divisors is an integer number (7373416606400).
Almost surely, 2122313312021141 is an apocalyptic number.
It is an amenable number.
122313312021141 is a deficient number, since it is larger than the sum of its proper divisors (54648686532459).
122313312021141 is a wasteful number, since it uses less digits than its factorization.
122313312021141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7514545 (or 7514542 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 122313312021141 its reverse (141120213313221), we get a palindrome (263433525334362).
The spelling of 122313312021141 in words is "one hundred twenty-two trillion, three hundred thirteen billion, three hundred twelve million, twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •