Base | Representation |
---|---|
bin | 11011100000110101000000… |
… | …110000100100001110010000 |
3 | 120212102210102001202112220101 |
4 | 123200311000300210032100 |
5 | 111330004023211301222 |
6 | 1105204034104422144 |
7 | 34326123046313362 |
oct | 3340650060441620 |
9 | 525383361675811 |
10 | 121003200103312 |
11 | 35612194a0308a |
12 | 116a3292a77954 |
13 | 526972569c067 |
14 | 21c482c4cad32 |
15 | dec886cda927 |
hex | 6e0d40c24390 |
121003200103312 has 40 divisors (see below), whose sum is σ = 244932003973440. Its totient is φ = 57801287237760.
The previous prime is 121003200103301. The next prime is 121003200103403. The reversal of 121003200103312 is 213301002300121.
It is a self number, because there is not a number n which added to its sum of digits gives 121003200103312.
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 7 ways as a sum of consecutive naturals, for example, 198014014 + ... + 198624157.
It is an arithmetic number, because the mean of its divisors is an integer number (6123300099336).
Almost surely, 2121003200103312 is an apocalyptic number.
It is an amenable number.
121003200103312 is an abundant number, since it is smaller than the sum of its proper divisors (123928803870128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121003200103312 is a wasteful number, since it uses less digits than its factorization.
121003200103312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396639031 (or 396639025 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121003200103312 its reverse (213301002300121), we get a palindrome (334304202403433).
The spelling of 121003200103312 in words is "one hundred twenty-one trillion, three billion, two hundred million, one hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •