Base | Representation |
---|---|
bin | 110011011010110011… |
… | …1011111011111011111 |
3 | 101120000102222201101022 |
4 | 1212311213133133133 |
5 | 3302120312223403 |
6 | 122420553434355 |
7 | 10656224544110 |
oct | 1466547373737 |
9 | 346012881338 |
10 | 110421211103 |
11 | 42913993265 |
12 | 19497a0b9bb |
13 | a549856c48 |
14 | 54b710a207 |
15 | 2d1409ad38 |
hex | 19b59df7df |
110421211103 has 8 divisors (see below), whose sum is σ = 133618944672. Its totient is φ = 89079296256.
The previous prime is 110421211073. The next prime is 110421211123. The reversal of 110421211103 is 301112124011.
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 110421211103 - 26 = 110421211039 is a prime.
It is a super-2 number, since 2×1104212111032 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110421211123) 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, 463954550 + ... + 463954787.
It is an arithmetic number, because the mean of its divisors is an integer number (16702368084).
Almost surely, 2110421211103 is an apocalyptic number.
110421211103 is a deficient number, since it is larger than the sum of its proper divisors (23197733569).
110421211103 is an equidigital number, since it uses as much as digits as its factorization.
110421211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927909361.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 110421211103 its reverse (301112124011), we get a palindrome (411533335114).
The spelling of 110421211103 in words is "one hundred ten billion, four hundred twenty-one million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •