Base | Representation |
---|---|
bin | 11011100000111100011110… |
… | …001100010001110100101011 |
3 | 120212110120002021222112200210 |
4 | 123200330132030101310223 |
5 | 111330121424241200021 |
6 | 1105211441002432203 |
7 | 34326525411210420 |
oct | 3340743614216453 |
9 | 525416067875623 |
10 | 121011210100011 |
11 | 35615625389170 |
12 | 116a4949502663 |
13 | 526a40100238a |
14 | 21c4d8c237d47 |
15 | decba510ce76 |
hex | 6e0f1e311d2b |
121011210100011 has 32 divisors (see below), whose sum is σ = 207650572517376. Its totient is φ = 60835128660000.
The previous prime is 121011210099977. The next prime is 121011210100051. The reversal of 121011210100011 is 110001012110121.
It is not a de Polignac number, because 121011210100011 - 29 = 121011210099499 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121011210100011.
It is not an unprimeable number, because it can be changed into a prime (121011210100051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8449316265 + ... + 8449330586.
It is an arithmetic number, because the mean of its divisors is an integer number (6489080391168).
Almost surely, 2121011210100011 is an apocalyptic number.
121011210100011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121011210100011 is a deficient number, since it is larger than the sum of its proper divisors (86639362417365).
121011210100011 is a wasteful number, since it uses less digits than its factorization.
121011210100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16898646903.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 121011210100011 its reverse (110001012110121), we get a palindrome (231012222210132).
The spelling of 121011210100011 in words is "one hundred twenty-one trillion, eleven billion, two hundred ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •