Base | Representation |
---|---|
bin | 111000010110011000… |
… | …0111110100110010110 |
3 | 102120100101220002011102 |
4 | 1300230300332212112 |
5 | 3440312042333420 |
6 | 131331414510102 |
7 | 11512513025624 |
oct | 1605460764626 |
9 | 376311802142 |
10 | 121010121110 |
11 | 4735807105a |
12 | 1b552065332 |
13 | b546559278 |
14 | 5bdd56a514 |
15 | 32339d5a75 |
hex | 1c2cc3e996 |
121010121110 has 8 divisors (see below), whose sum is σ = 217818218016. Its totient is φ = 48404048440.
The previous prime is 121010121061. The next prime is 121010121121. The reversal of 121010121110 is 11121010121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1210101211102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121010121091 and 121010121100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6050506046 + ... + 6050506065.
It is an arithmetic number, because the mean of its divisors is an integer number (27227277252).
Almost surely, 2121010121110 is an apocalyptic number.
121010121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121010121110 is a deficient number, since it is larger than the sum of its proper divisors (96808096906).
121010121110 is a wasteful number, since it uses less digits than its factorization.
121010121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12101012118.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121010121110 its reverse (11121010121), we get a palindrome (132131131231).
The spelling of 121010121110 in words is "one hundred twenty-one billion, ten million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •