Base | Representation |
---|---|
bin | 11001000111001001011011… |
… | …110110101111000000110111 |
3 | 112111001011221212201021021222 |
4 | 121013021123312233000313 |
5 | 103433441343002434333 |
6 | 1030520301145300555 |
7 | 32156123616530030 |
oct | 3107113366570067 |
9 | 474034855637258 |
10 | 110442330124343 |
11 | 32210369147528 |
12 | 10478568a9475b |
13 | 4981889653949 |
14 | 1d3b619d41a87 |
15 | cb7cd2465298 |
hex | 64725bdaf037 |
110442330124343 has 16 divisors (see below), whose sum is σ = 126714991451136. Its totient is φ = 94293551917440.
The previous prime is 110442330124333. The next prime is 110442330124361. The reversal of 110442330124343 is 343421033244011.
It is a cyclic number.
It is not a de Polignac number, because 110442330124343 - 26 = 110442330124279 is a prime.
It is a super-2 number, since 2×1104423301243432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110442330124333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11691455 + ... + 18909647.
It is an arithmetic number, because the mean of its divisors is an integer number (7919686965696).
Almost surely, 2110442330124343 is an apocalyptic number.
110442330124343 is a deficient number, since it is larger than the sum of its proper divisors (16272661326793).
110442330124343 is an equidigital number, since it uses as much as digits as its factorization.
110442330124343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7226774.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 110442330124343 its reverse (343421033244011), we get a palindrome (453863363368354).
The spelling of 110442330124343 in words is "one hundred ten trillion, four hundred forty-two billion, three hundred thirty million, one hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •