Base | Representation |
---|---|
bin | 110011001111111100… |
… | …0111001001101011111 |
3 | 101112002001001022200102 |
4 | 1212133320321031133 |
5 | 3300344002033033 |
6 | 122320452251315 |
7 | 10644210203123 |
oct | 1463770711537 |
9 | 345061038612 |
10 | 110056674143 |
11 | 4274713a249 |
12 | 193b5910b3b |
13 | a4bc1810c0 |
14 | 5480937583 |
15 | 2ce208ede8 |
hex | 199fe3935f |
110056674143 has 4 divisors (see below), whose sum is σ = 118522572168. Its totient is φ = 101590776120.
The previous prime is 110056674121. The next prime is 110056674151. The reversal of 110056674143 is 341476650011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110056674143 - 228 = 109788238687 is a prime.
It is a super-2 number, since 2×1100566741432 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110056674097 and 110056674106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110056674443) 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, 4232948993 + ... + 4232949018.
It is an arithmetic number, because the mean of its divisors is an integer number (29630643042).
Almost surely, 2110056674143 is an apocalyptic number.
110056674143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
110056674143 is a deficient number, since it is larger than the sum of its proper divisors (8465898025).
110056674143 is an equidigital number, since it uses as much as digits as its factorization.
110056674143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8465898024.
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 110056674143 in words is "one hundred ten billion, fifty-six million, six hundred seventy-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •