Base | Representation |
---|---|
bin | 11011100101010101101111… |
… | …011001000000101111010001 |
3 | 120220112102121220002022100112 |
4 | 123211111233121000233101 |
5 | 111400043433321244441 |
6 | 1110002305101131105 |
7 | 34360406453656334 |
oct | 3345255731005721 |
9 | 526472556068315 |
10 | 121313220103121 |
11 | 35721714134562 |
12 | 11733393b59a95 |
13 | 528ca3139b427 |
14 | 21d583c2ba61b |
15 | e0597dea84eb |
hex | 6e556f640bd1 |
121313220103121 has 16 divisors (see below), whose sum is σ = 123274389528576. Its totient is φ = 119371787730000.
The previous prime is 121313220103099. The next prime is 121313220103129. The reversal of 121313220103121 is 121301022313121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121313220103121 - 218 = 121313219840977 is a prime.
It is a super-2 number, since 2×1213132201031212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121313220103129) 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, 13415 + ... + 15576476.
It is an arithmetic number, because the mean of its divisors is an integer number (7704649345536).
Almost surely, 2121313220103121 is an apocalyptic number.
It is an amenable number.
121313220103121 is a deficient number, since it is larger than the sum of its proper divisors (1961169425455).
121313220103121 is a wasteful number, since it uses less digits than its factorization.
121313220103121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15590524.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 121313220103121 its reverse (121301022313121), we get a palindrome (242614242416242).
The spelling of 121313220103121 in words is "one hundred twenty-one trillion, three hundred thirteen billion, two hundred twenty million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •