Base | Representation |
---|---|
bin | 110011011011001110… |
… | …0111010001100100001 |
3 | 101120001102100010220022 |
4 | 1212312130322030201 |
5 | 3302132403322423 |
6 | 122422213523225 |
7 | 10656454555160 |
oct | 1466634721441 |
9 | 346042303808 |
10 | 110435214113 |
11 | 429208879a4 |
12 | 194a0643515 |
13 | a54c71a853 |
14 | 54b8d133d7 |
15 | 2d15414dc8 |
hex | 19b673a321 |
110435214113 has 8 divisors (see below), whose sum is σ = 126985979328. Its totient is φ = 94078025424.
The previous prime is 110435214079. The next prime is 110435214133. The reversal of 110435214113 is 311412534011.
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 110435214113 - 26 = 110435214049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110435214133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48392906 + ... + 48395187.
It is an arithmetic number, because the mean of its divisors is an integer number (15873247416).
Almost surely, 2110435214113 is an apocalyptic number.
It is an amenable number.
110435214113 is a deficient number, since it is larger than the sum of its proper divisors (16550765215).
110435214113 is an equidigital number, since it uses as much as digits as its factorization.
110435214113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96788263.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 110435214113 its reverse (311412534011), we get a palindrome (421847748124).
The spelling of 110435214113 in words is "one hundred ten billion, four hundred thirty-five million, two hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •