Base | Representation |
---|---|
bin | 110011001110100101… |
… | …1001000000111001001 |
3 | 101111221212100001001111 |
4 | 1212131023020013021 |
5 | 3300300321401441 |
6 | 122312144050321 |
7 | 10643115052315 |
oct | 1463513100711 |
9 | 344855301044 |
10 | 110011122121 |
11 | 4272345734a |
12 | 193a26039a1 |
13 | a4b28c2444 |
14 | 547887ab45 |
15 | 2cdd093081 |
hex | 199d2c81c9 |
110011122121 has 4 divisors (see below), whose sum is σ = 115801181200. Its totient is φ = 104221063044.
The previous prime is 110011122107. The next prime is 110011122157. The reversal of 110011122121 is 121221110011.
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.
It is a cyclic number.
It is not a de Polignac number, because 110011122121 - 27 = 110011121993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110011123121) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2895029511 + ... + 2895029548.
It is an arithmetic number, because the mean of its divisors is an integer number (28950295300).
Almost surely, 2110011122121 is an apocalyptic number.
It is an amenable number.
110011122121 is a deficient number, since it is larger than the sum of its proper divisors (5790059079).
110011122121 is an equidigital number, since it uses as much as digits as its factorization.
110011122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5790059078.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110011122121 its reverse (121221110011), we get a palindrome (231232232132).
The spelling of 110011122121 in words is "one hundred ten billion, eleven million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •