Base | Representation |
---|---|
bin | 11011100000110010001111… |
… | …001100100100110000111000 |
3 | 120212102111201110020120010120 |
4 | 123200302033030210300320 |
5 | 111324431423100213422 |
6 | 1105202422330213240 |
7 | 34325656164233643 |
oct | 3340621714446070 |
9 | 525374643216116 |
10 | 121000221101112 |
11 | 356109a63846a1 |
12 | 116a27a1284220 |
13 | 526936c45a172 |
14 | 21c46289cca5a |
15 | dec7604e345c |
hex | 6e0c8f324c38 |
121000221101112 has 64 divisors (see below), whose sum is σ = 313425590914080. Its totient is φ = 38896028946432.
The previous prime is 121000221101101. The next prime is 121000221101113. The reversal of 121000221101112 is 211101122000121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 121000221101091 and 121000221101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121000221101113) 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, 602826693 + ... + 603027380.
Almost surely, 2121000221101112 is an apocalyptic number.
121000221101112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121000221101112 is an abundant number, since it is smaller than the sum of its proper divisors (192425369812968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121000221101112 is a wasteful number, since it uses less digits than its factorization.
121000221101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1205854232 (or 1205854228 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 121000221101112 its reverse (211101122000121), we get a palindrome (332101343101233).
The spelling of 121000221101112 in words is "one hundred twenty-one trillion, two hundred twenty-one million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •