Base | Representation |
---|---|
bin | 110011110101000000… |
… | …0010001000110101001 |
3 | 101122021200210222002202 |
4 | 1213222000101012221 |
5 | 3310420312333001 |
6 | 123044111505545 |
7 | 11020056263456 |
oct | 1475200210651 |
9 | 348250728082 |
10 | 111300121001 |
11 | 43225020283 |
12 | 196a22282b5 |
13 | a659977c84 |
14 | 555bb3682d |
15 | 2d6630d96b |
hex | 19ea0111a9 |
111300121001 has 4 divisors (see below), whose sum is σ = 113888495952. Its totient is φ = 108711746052.
The previous prime is 111300120991. The next prime is 111300121019. The reversal of 111300121001 is 100121003111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 100121003111 = 27239 ⋅3675649.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111300121001 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 (111300121901) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1294187411 + ... + 1294187496.
It is an arithmetic number, because the mean of its divisors is an integer number (28472123988).
Almost surely, 2111300121001 is an apocalyptic number.
It is an amenable number.
111300121001 is a deficient number, since it is larger than the sum of its proper divisors (2588374951).
111300121001 is an equidigital number, since it uses as much as digits as its factorization.
111300121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2588374950.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111300121001 its reverse (100121003111), we get a palindrome (211421124112).
The spelling of 111300121001 in words is "one hundred eleven billion, three hundred million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •