Base | Representation |
---|---|
bin | 11011101111010101011101… |
… | …111000110100111111110111 |
3 | 120222222002122012201120000022 |
4 | 123233111131320310333313 |
5 | 111442322222013033421 |
6 | 1111250025412035355 |
7 | 34461134510100440 |
oct | 3357253570647767 |
9 | 528862565646008 |
10 | 122000121221111 |
11 | 35966a62990231 |
12 | 11824535902b5b |
13 | 530c73cb249c3 |
14 | 221aba1a762c7 |
15 | e187830ca7ab |
hex | 6ef55de34ff7 |
122000121221111 has 8 divisors (see below), whose sum is σ = 139438168650144. Its totient is φ = 104564438462880.
The previous prime is 122000121221107. The next prime is 122000121221129. The reversal of 122000121221111 is 111122121000221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122000121221111 - 22 = 122000121221107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122000121221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122000121221101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 591057140 + ... + 591263513.
It is an arithmetic number, because the mean of its divisors is an integer number (17429771081268).
Almost surely, 2122000121221111 is an apocalyptic number.
122000121221111 is a deficient number, since it is larger than the sum of its proper divisors (17438047429033).
122000121221111 is a wasteful number, since it uses less digits than its factorization.
122000121221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182335401.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 122000121221111 its reverse (111122121000221), we get a palindrome (233122242221332).
The spelling of 122000121221111 in words is "one hundred twenty-two trillion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •