Base | Representation |
---|---|
bin | 11011100010011001100000… |
… | …001010001100111111100001 |
3 | 120212211002220212112010001002 |
4 | 123202121200022030333201 |
5 | 111333241013340200001 |
6 | 1105325401033321345 |
7 | 34336662662540555 |
oct | 3342314012147741 |
9 | 525732825463032 |
10 | 121111101100001 |
11 | 35653a25235a11 |
12 | 11700186866255 |
13 | 527696006996c |
14 | 21c9b46a03865 |
15 | e0059e9b646b |
hex | 6e266028cfe1 |
121111101100001 has 8 divisors (see below), whose sum is σ = 121320401079360. Its totient is φ = 120901955761008.
The previous prime is 121111101099983. The next prime is 121111101100049. The reversal of 121111101100001 is 100001101111121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121111101100001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (121111101100081) 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, 37092326 + ... + 40225151.
It is an arithmetic number, because the mean of its divisors is an integer number (15165050134920).
Almost surely, 2121111101100001 is an apocalyptic number.
It is an amenable number.
121111101100001 is a deficient number, since it is larger than the sum of its proper divisors (209299979359).
121111101100001 is an equidigital number, since it uses as much as digits as its factorization.
121111101100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77320183.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 121111101100001 its reverse (100001101111121), we get a palindrome (221112202211122).
The spelling of 121111101100001 in words is "one hundred twenty-one trillion, one hundred eleven billion, one hundred one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •