Base | Representation |
---|---|
bin | 11011110010101011110001… |
… | …000001100010100011111101 |
3 | 121000210002120101212011220110 |
4 | 123302223301001202203331 |
5 | 112010104444043203313 |
6 | 1111543442252140233 |
7 | 34513561605120036 |
oct | 3362536101424375 |
9 | 530702511764813 |
10 | 122230223022333 |
11 | 35a456013a71a8 |
12 | 11861052467679 |
13 | 532835063057a |
14 | 2227d8d901a8d |
15 | e1e74e086ec3 |
hex | 6f2af10628fd |
122230223022333 has 32 divisors (see below), whose sum is σ = 164857669632000. Its totient is φ = 80548173734336.
The previous prime is 122230223022317. The next prime is 122230223022379. The reversal of 122230223022333 is 333220322032221.
It is a cyclic number.
It is not a de Polignac number, because 122230223022333 - 24 = 122230223022317 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122230223022333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122230223022533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1660406635 + ... + 1660480247.
It is an arithmetic number, because the mean of its divisors is an integer number (5151802176000).
Almost surely, 2122230223022333 is an apocalyptic number.
It is an amenable number.
122230223022333 is a deficient number, since it is larger than the sum of its proper divisors (42627446609667).
122230223022333 is a wasteful number, since it uses less digits than its factorization.
122230223022333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85001.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 122230223022333 its reverse (333220322032221), we get a palindrome (455450545054554).
The spelling of 122230223022333 in words is "one hundred twenty-two trillion, two hundred thirty billion, two hundred twenty-three million, twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •