Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0100110001011111001 |
3 | 101112012001210012101102 |
4 | 1212202132212023321 |
5 | 3300441112041441 |
6 | 122325043301145 |
7 | 10645245340346 |
oct | 1464236461371 |
9 | 345161705342 |
10 | 110100112121 |
11 | 427697088aa |
12 | 1940837a7b5 |
13 | a4c817c74c |
14 | 54866037cd |
15 | 2ce5cc069b |
hex | 19a27a62f9 |
110100112121 has 4 divisors (see below), whose sum is σ = 110119430244. Its totient is φ = 110080794000.
The previous prime is 110100112051. The next prime is 110100112127. The reversal of 110100112121 is 121211001011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 90237156025 + 19862956096 = 300395^2 + 140936^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100112121 - 222 = 110095917817 is a prime.
It is a super-2 number, since 2×1101001121212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110100112127) 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, 9650510 + ... + 9661911.
It is an arithmetic number, because the mean of its divisors is an integer number (27529857561).
Almost surely, 2110100112121 is an apocalyptic number.
It is an amenable number.
110100112121 is a deficient number, since it is larger than the sum of its proper divisors (19318123).
110100112121 is an equidigital number, since it uses as much as digits as its factorization.
110100112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19318122.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110100112121 its reverse (121211001011), we get a palindrome (231311113132).
The spelling of 110100112121 in words is "one hundred ten billion, one hundred million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •