Base | Representation |
---|---|
bin | 111000111101101111… |
… | …1110010000001100110 |
3 | 102200202110101100111111 |
4 | 1301323133302001212 |
5 | 4001013214410342 |
6 | 132110442055234 |
7 | 11560322312215 |
oct | 1617337620146 |
9 | 380673340444 |
10 | 122331013222 |
11 | 47975738930 |
12 | 1b8604aa51a |
13 | b6c70ca732 |
14 | 5cc6b6907c |
15 | 32ae951217 |
hex | 1c7b7f2066 |
122331013222 has 8 divisors (see below), whose sum is σ = 200178021672. Its totient is φ = 55605006000.
The previous prime is 122331013193. The next prime is 122331013241. The reversal of 122331013222 is 222310133221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1223310132222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 5560500601 = 122331013222 / (1 + 2 + 2 + 3 + 3 + 1 + 0 + 1 + 3 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 122331013193 and 122331013202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2780250279 + ... + 2780250322.
It is an arithmetic number, because the mean of its divisors is an integer number (25022252709).
Almost surely, 2122331013222 is an apocalyptic number.
122331013222 is a deficient number, since it is larger than the sum of its proper divisors (77847008450).
122331013222 is a wasteful number, since it uses less digits than its factorization.
122331013222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5560500614.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122331013222 its reverse (222310133221), we get a palindrome (344641146443).
The spelling of 122331013222 in words is "one hundred twenty-two billion, three hundred thirty-one million, thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •