Base | Representation |
---|---|
bin | 111000010110011000… |
… | …1010111000000110110 |
3 | 102120100102002011100010 |
4 | 1300230301113000312 |
5 | 3440312104033420 |
6 | 131331421001050 |
7 | 11512513623312 |
oct | 1605461270066 |
9 | 376312064303 |
10 | 121010221110 |
11 | 4735812a1a9 |
12 | 1b5520b3186 |
13 | b54659293c |
14 | 5bdd594b42 |
15 | 3233a054e0 |
hex | 1c2cc57036 |
121010221110 has 64 divisors (see below), whose sum is σ = 291295740672. Its totient is φ = 32172706176.
The previous prime is 121010221099. The next prime is 121010221121. The reversal of 121010221110 is 11122010121.
It is an interprime number because it is at equal distance from previous prime (121010221099) and next prime (121010221121).
It is a super-2 number, since 2×1210102211102 (a number of 23 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 24809992 + ... + 24814868.
It is an arithmetic number, because the mean of its divisors is an integer number (4551495948).
Almost surely, 2121010221110 is an apocalyptic number.
121010221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121010221110 is an abundant number, since it is smaller than the sum of its proper divisors (170285519562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010221110 is a wasteful number, since it uses less digits than its factorization.
121010221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7197.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121010221110 its reverse (11122010121), we get a palindrome (132132231231).
The spelling of 121010221110 in words is "one hundred twenty-one billion, ten million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •