Base | Representation |
---|---|
bin | 11011100000111100010111… |
… | …101100100001011100100101 |
3 | 120212110112210200220101101112 |
4 | 123200330113230201130211 |
5 | 111330121213341041401 |
6 | 1105211422110434405 |
7 | 34326522615632414 |
oct | 3340742754413445 |
9 | 525415720811345 |
10 | 121011101112101 |
11 | 35615579908a12 |
12 | 116a4918b02a05 |
13 | 526a3b45628a5 |
14 | 21c4d7b98747b |
15 | decb9a7803bb |
hex | 6e0f17b21725 |
121011101112101 has 8 divisors (see below), whose sum is σ = 121058303635584. Its totient is φ = 120963905904400.
The previous prime is 121011101112017. The next prime is 121011101112113. The reversal of 121011101112101 is 101211101110121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121011101112101 - 222 = 121011096917797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011101112131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31377176 + ... + 35022126.
It is an arithmetic number, because the mean of its divisors is an integer number (15132287954448).
Almost surely, 2121011101112101 is an apocalyptic number.
It is an amenable number.
121011101112101 is a deficient number, since it is larger than the sum of its proper divisors (47202523483).
121011101112101 is an equidigital number, since it uses as much as digits as its factorization.
121011101112101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3657891.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 121011101112101 its reverse (101211101110121), we get a palindrome (222222202222222).
The spelling of 121011101112101 in words is "one hundred twenty-one trillion, eleven billion, one hundred one million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.577 sec. • engine limits •