Base | Representation |
---|---|
bin | 11011100011111111000010… |
… | …010100110001101010010000 |
3 | 120220012112022201222220010202 |
4 | 123203333002110301222100 |
5 | 111342032302242034300 |
6 | 1105451431054314332 |
7 | 34350602430016142 |
oct | 3343770224615220 |
9 | 526175281886122 |
10 | 121220122221200 |
11 | 3569618a878982 |
12 | 117193317b89a8 |
13 | 5284015813232 |
14 | 21d1129bb6c92 |
15 | e03330ba0ad5 |
hex | 6e3fc2531a90 |
121220122221200 has 60 divisors (see below), whose sum is σ = 291376164736368. Its totient is φ = 48463937155200.
The previous prime is 121220122221181. The next prime is 121220122221307. The reversal of 121220122221200 is 2122221022121.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 11 ways as a sum of consecutive naturals, for example, 74543762 + ... + 76152561.
Almost surely, 2121220122221200 is an apocalyptic number.
121220122221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121220122221200 is an abundant number, since it is smaller than the sum of its proper divisors (170156042515168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121220122221200 is a wasteful number, since it uses less digits than its factorization.
121220122221200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150698352 (or 150698341 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 121220122221200 its reverse (2122221022121), we get a palindrome (123342343243321).
The spelling of 121220122221200 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred twenty-two million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •