Base | Representation |
---|---|
bin | 11011100000111011100011… |
… | …001111111011011011001111 |
3 | 120212110110112101012021102022 |
4 | 123200323203033323123033 |
5 | 111330112413111413403 |
6 | 1105211154515120355 |
7 | 34326462042543263 |
oct | 3340734317733317 |
9 | 525413471167368 |
10 | 121010221201103 |
11 | 35615168157843 |
12 | 116a47122a30bb |
13 | 526a2a4180cb0 |
14 | 21c4cd6b7a0a3 |
15 | decb483c0d38 |
hex | 6e0ee33fb6cf |
121010221201103 has 16 divisors (see below), whose sum is σ = 133498600739616. Its totient is φ = 108976170216960.
The previous prime is 121010221201069. The next prime is 121010221201139. The reversal of 121010221201103 is 301102122010121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121010221201103 - 222 = 121010217006799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121010221201403) 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, 52065200 + ... + 54339722.
It is an arithmetic number, because the mean of its divisors is an integer number (8343662546226).
Almost surely, 2121010221201103 is an apocalyptic number.
121010221201103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
121010221201103 is a deficient number, since it is larger than the sum of its proper divisors (12488379538513).
121010221201103 is a wasteful number, since it uses less digits than its factorization.
121010221201103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2374394.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 121010221201103 its reverse (301102122010121), we get a palindrome (422112343211224).
The spelling of 121010221201103 in words is "one hundred twenty-one trillion, ten billion, two hundred twenty-one million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •