Base | Representation |
---|---|
bin | 11011100101001010011000… |
… | …011001100110100110111000 |
3 | 120220111021010212111120011010 |
4 | 123211022120121212212320 |
5 | 111344343443421102300 |
6 | 1105552530515433520 |
7 | 34356465302125623 |
oct | 3345123031464670 |
9 | 526437125446133 |
10 | 121301023222200 |
11 | 35717525330388 |
12 | 11730b4b2b58a0 |
13 | 528b839502223 |
14 | 21d500248cdba |
15 | e054b82e7a50 |
hex | 6e52986669b8 |
121301023222200 has 192 divisors, whose sum is σ = 396427624508160. Its totient is φ = 30621575761920.
The previous prime is 121301023222151. The next prime is 121301023222217. The reversal of 121301023222200 is 2222320103121.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43970314 + ... + 46647513.
It is an arithmetic number, because the mean of its divisors is an integer number (2064727210980).
Almost surely, 2121301023222200 is an apocalyptic number.
121301023222200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121301023222200 is an abundant number, since it is smaller than the sum of its proper divisors (275126601285960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121301023222200 is a wasteful number, since it uses less digits than its factorization.
121301023222200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90617966 (or 90617957 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 121301023222200 its reverse (2222320103121), we get a palindrome (123523343325321).
The spelling of 121301023222200 in words is "one hundred twenty-one trillion, three hundred one billion, twenty-three million, two hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •