Base | Representation |
---|---|
bin | 11011100100000000000010… |
… | …101000011010110000111000 |
3 | 120220012122002221010020020201 |
4 | 123210000002220122300320 |
5 | 111342042004441041440 |
6 | 1105452130114531544 |
7 | 34350641240313544 |
oct | 3344000250326070 |
9 | 526178087106221 |
10 | 121221201112120 |
11 | 3569669388566a |
12 | 11719592b96bb4 |
13 | 52841581b2a25 |
14 | 21d11cd1bca24 |
15 | e0339576719a |
hex | 6e4002a1ac38 |
121221201112120 has 16 divisors (see below), whose sum is σ = 272747702502360. Its totient is φ = 48488480444832.
The previous prime is 121221201112057. The next prime is 121221201112147. The reversal of 121221201112120 is 21211102122121.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1515265013862 + ... + 1515265013941.
Almost surely, 2121221201112120 is an apocalyptic number.
121221201112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121221201112120 is an abundant number, since it is smaller than the sum of its proper divisors (151526501390240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121221201112120 is a wasteful number, since it uses less digits than its factorization.
121221201112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3030530027814 (or 3030530027810 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121221201112120 its reverse (21211102122121), we get a palindrome (142432303234241).
The spelling of 121221201112120 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, two hundred one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •