Base | Representation |
---|---|
bin | 11011100010010000010010… |
… | …100110101001111100110011 |
3 | 120212210011101112200020021120 |
4 | 123202100102212221330303 |
5 | 111333110234230014303 |
6 | 1105321043340553323 |
7 | 34336162606563045 |
oct | 3342202246517463 |
9 | 525704345606246 |
10 | 121101210001203 |
11 | 3564a809a41aa3 |
12 | 116ba286252843 |
13 | 5275a44abb693 |
14 | 21c948910ba95 |
15 | e001c146a553 |
hex | 6e24129a9f33 |
121101210001203 has 16 divisors (see below), whose sum is σ = 161537572498176. Its totient is φ = 80699499620960.
The previous prime is 121101210001201. The next prime is 121101210001241. The reversal of 121101210001203 is 302100012101121.
It is a cyclic number.
It is not a de Polignac number, because 121101210001203 - 21 = 121101210001201 is a prime.
It is a super-2 number, since 2×1211012100012032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121101210001201) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 82490476 + ... + 83945702.
It is an arithmetic number, because the mean of its divisors is an integer number (10096098281136).
Almost surely, 2121101210001203 is an apocalyptic number.
121101210001203 is a deficient number, since it is larger than the sum of its proper divisors (40436362496973).
121101210001203 is a wasteful number, since it uses less digits than its factorization.
121101210001203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1467114.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 121101210001203 its reverse (302100012101121), we get a palindrome (423201222102324).
The spelling of 121101210001203 in words is "one hundred twenty-one trillion, one hundred one billion, two hundred ten million, one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •