Base | Representation |
---|---|
bin | 11011110000000011111101… |
… | …101001111110001010110011 |
3 | 121000010212111120121102110020 |
4 | 123300003331221332022303 |
5 | 111444131443324240311 |
6 | 1111325003420134523 |
7 | 34464552632331462 |
oct | 3360037551761263 |
9 | 530125446542406 |
10 | 122050046321331 |
11 | 35986152345a37 |
12 | 11832149697443 |
13 | 53143681cb91b |
14 | 221d37a46a9d9 |
15 | e19c060c7c06 |
hex | 6f00fda7e2b3 |
122050046321331 has 16 divisors (see below), whose sum is σ = 163183639503360. Its totient is φ = 81141630262560.
The previous prime is 122050046321303. The next prime is 122050046321429. The reversal of 122050046321331 is 133123640050221.
It is not a de Polignac number, because 122050046321331 - 26 = 122050046321267 is a prime.
It is a super-2 number, since 2×1220500463213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122050046321292 and 122050046321301.
It is not an unprimeable number, because it can be changed into a prime (122050046322331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2033961 + ... + 15755541.
It is an arithmetic number, because the mean of its divisors is an integer number (10198977468960).
Almost surely, 2122050046321331 is an apocalyptic number.
122050046321331 is a deficient number, since it is larger than the sum of its proper divisors (41133593182029).
122050046321331 is a wasteful number, since it uses less digits than its factorization.
122050046321331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13729786.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 122050046321331 its reverse (133123640050221), we get a palindrome (255173686371552).
The spelling of 122050046321331 in words is "one hundred twenty-two trillion, fifty billion, forty-six million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •